Revision as of 17:23, 27 May 2002 edit LC~enwiki (talk \| contribs) 950 edits More common term: "shortest spanning tree" -> "minimal spanning tree" ← Previous edit		Revision as of 17:24, 27 May 2002 edit undo LC~enwiki (talk \| contribs) 950 edits No edit summary Next edit →
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]]: computes the [[~~minimal~~minimum spanning tree problem\|~~minimal~~minimum spanning tree]] in a graph ** [[Ford-Fulkerson algorithm]]: computes the [[maximum flow problem\|maximum flow]] in a graph * Other:

List of algorithms: Difference between revisions