Editing List of algorithms (section)

====Routing for graphs====
* [[Edmonds' algorithm]] (also known as Chu–Liu/Edmonds' algorithm): find maximum or minimum branchings
* [[Euclidean minimum spanning tree]]: algorithms for computing the minimum spanning tree of a set of points in the plane
* [[Longest path problem]]: find a simple path of maximum length in a given graph
* [[Minimum spanning tree]]
** [[Borůvka's algorithm]]
** [[Kruskal's algorithm]]
** [[Prim's algorithm]]
** [[Reverse-delete algorithm]]
* [[Nonblocking minimal spanning switch]] say, for a [[telephone exchange]]
* [[Vehicle routing problem]]
** Clarke and Wright Saving algorithm
* [[Shortest path problem]]
** [[Bellman–Ford algorithm]]: computes [[shortest path problem|shortest paths]] in a weighted graph (where some of the edge weights may be negative)
** [[Dijkstra's algorithm]]: computes [[shortest path problem|shortest paths]] in a graph with non-negative edge weights
** [[Floyd–Warshall algorithm]]: solves the [[shortest path problem#All-pairs shortest paths|all pairs shortest path]] problem in a weighted, directed graph
** [[Johnson's algorithm]]: all pairs shortest path algorithm in sparse weighted directed graph
<!-- ** [[Perturbation methods]]: an algorithm that computes a locally [[shortest path problem|shortest paths]] in a graph -->
* [[Transitive closure]] problem: find the [[transitive closure]] of a given binary relation
* [[Traveling salesman problem]]
** [[Christofides algorithm]]
** [[Nearest neighbour algorithm]]
* [[Warnsdorff's rule]]: a heuristic method for solving the [[Knight's tour]] problem