Graphs and Basic Traversal Techniques

Model relationships as vertices and edges, then traverse them: adjacency lists vs. matrices, BFS and DFS, their classic applications (shortest paths in unweighted graphs, connected components, topological sort), union-find, and the two greedy MST algorithms — Kruskal and Prim.