Showing Posts From
Dijkstra
- 05 Jan, 2026
Graphs: Shortest Paths & Dijkstra
Week 24 notes: once edges have weights, plain BFS isn't enough. Picking between BFS, 0-1 BFS, Dijkstra, and Bellman-Ford, plus topological sort for dependency ordering.
Showing Posts From
Week 24 notes: once edges have weights, plain BFS isn't enough. Picking between BFS, 0-1 BFS, Dijkstra, and Bellman-Ford, plus topological sort for dependency ordering.