Algorithm 
Pages 
Running time 
Longest common subsequence  353355  O(mn) 
Optimal Binary Search Tree  356362  Θ(n^{3}) 
GreedyActivitySelector  376378  if already sorted Θ(n) 
Huffman  385391  O(nlgn) 
BFS Directed and undirected graphs  531538  O(V+E) 
DFS Directed and undirected graphs  540547  Θ(V+E) 
Topologicalsort Undirected graphs  549551  Θ(V+E) 
StronglyConnectedComponents Undirected graphs  552557  Θ(V+E) 
 Minimum spanning trees  
Kruskal  568570  O(ElgV) 
Prim  570573  Binary heap  Fibonacci heap  O(ElgV)  O(E+VlgV) 

 Single source shortest paths  
BellmanFord Weighed directed with negative weights but no negative cycles  588591  O(VE) 
DAGShortest Path Directed Accyclic Graph  592595  Θ(V+E) 
Dijkstra Weighed directed with no negative weights  595599  Array  Binary heap  Fibonacci heap  O(V^{2})  O(ElgV)  O(E+VlgV) 

 All pairs shortest paths (directed graphs with negative weigts but no negative cycles)  
Floyd Warshall  629632  Θ(V^{3}) 
Transitiveclosure  632634  Θ(V^{3}) 
 Maximum flow (directed graphs)  
Ford Fulkerson  651660  O(Vf*) (f* = maximum flow) 
EdmondKarp  660663  O(VE^{2}) 
 Matrix multiplication  
Strassen On a n×n matrix  735741  O(n^{2.81}) There is a O(n^{2.376}) See p. 741 