List of algorithms: Difference between revisions

Revision as of 17:55, 27 May 2002

Revision as of 03:27, 28 May 2002

Line 45:

* [[Graph theory|Graph algorithms]]:

** [[Dijkstra's algorithm]]: computes [[shortest path problem|shortest paths]] in a graph with non-negative edge weights

** [[Kruskal's algorithm]]: finds a [[minimum spanning tree problem|minimum spanning tree]] for a graph

** [[Prim's algorithm]]: finds a [[minimum spanning tree problem|minimum spanning tree]] for a graph

** [[Ford-Fulkerson algorithm]]: computes the [[maximum flow problem|maximum flow]] in a graph

* Other: