Current location - Education and Training Encyclopedia - Graduation thesis - What are the common algorithms?
What are the common algorithms?
copy

Matroid

violence

greedy

divide

Integer two

trichotomy

General dynamic specification and recursion

Steiner tree

Dynamic tree divide and conquer

Double SAT

Joint search

Differential constraint

shortest route

Minimum cut

Cost process

maximum flow

Network flow with upper and lower bounds

Virtual tree

Matrix tree theorem

minimum spanning tree

Divide and rule by points

Tree chain division

Pruefer coding

Hoffman tree

lagrange multiplier method

BSGS

theory of game

matrix multiplication

Gaussian elimination method

Inclusion and exclusion principle

drawer principle

Modular linear equation

mobius inversion

fast Fourier transform

Extended Euclidean algorithm (

Peishu theorem

Dfs order

Deep search

Iterative depth search

Breadth search

Bidirectional wide search

Heuristic search

Dance link

Palindrome automaton

KMP

Terry tree

suffix array

Aho corasick automaton

Suffix automaton

Manacher

convex hull

scanning beam

triangulation

Rotating blockage

Half-plane intersection

Cdq breaks down one by one

Mo team algorithm

Mountain climbing algorithm

Fractional programming

simulated annealing

Giulio Givanni Carlo Taccon algorithm

Random increment method

Multiplication algorithm