Showing Posts From
Graphs
- 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.
- 27 Oct, 2025
Graphs 101: BFS & DFS Traversals
Week 14 notes: a tree is just a graph without cycles. Graph representations, DFS and BFS with a visited set, shortest paths on unweighted graphs, and grids as graphs.