INPUT OUTPUT
Problem: Find the shortest path from s to t in G.
Excerpt from The Algorithm Design Manual: The problem of finding shortest paths in a graph has a surprising variety of applications:
The Boost Graph Library: user guide and reference manual by J. Siek and L. Lee and A. Lumsdaine | Network Flows : Theory, Algorithms, and Applications by Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin |
Connected Components |
Graph Isomorphism |
Matrix Multiplication |
Motion Planning |
Network Flow |
Priority Queues |
Steiner Tree |
Transitive Closure and Reduction |