Shortest Path

• Unweighed
  • Use BFS
    • $O(V+E)$
• Weighted
  • Dijkstra’s Algorithm
    • $O(E\log V)$
  • Bellman Ford
    • $O(VE)$
    • Negative weights allowed
    • No negative weight cycles allowed
  • Floyd-Warshall
    • All pair shortest paths