Single Source Shortest Path

Suppose you want to start from one node and get somewhere else quickly. This is called Single Source Shortest Path. There are two common algorithms that do this.

Slides

• BFS Shortest Path
• Dijkstra Shortest Path
• Bellman Ford and SPFA