Shortest path

Single-Source Shortest Path in UnWeighted Graphs

 * Breadth-First Search

Single-Source Shortest Path in Weighted Graphs

 * Dijkstra's Algorithm
 * Bellman-Ford's Algorithm

All Pairs Shortest Path

 * Floyd-Warshall's Algorithm

Source-Source Single-Sink Shortest Path in UnWeighted Graphs

 * Bidirectional Breadth-First Search