Graph Algorithms

BFS/DFS, shortest path (Dijkstra, Bellman-Ford), topological sort, union-find (disjoint set), minimum spanning tree.

Why we need this / what value this brings

Graphs are the most general data structure — trees and linked lists are special cases — and graph problems are where interview difficulty usually peaks.

When to use this

Networks, dependency graphs (build systems, task scheduling), any 'shortest path' or 'is this reachable' question, cycle detection.

How to use or implement this

Learn BFS for unweighted shortest path and Dijkstra for weighted before reaching for Bellman-Ford (only needed for negative weights); union-find for connectivity/cycle questions.

Research questions

• Topological sort has a genuine tie-in to CI/CD dependency graphs (DeveloperTools/CI-CD) and IaC resource ordering — worth a CaseStudy there.

---

Empty folder — drop notes, links, and findings here as you research.