Graph Representation
Adjacency matrix vs adjacency list.
Breadth-First Search
Level-order graph traversal.
Depth-First Search
Recursive and iterative DFS.
Topological Sort
Ordering nodes in a DAG.
Dijkstra's Algorithm
Single-source shortest path for non-negative weights.
Bellman-Ford
Shortest path with negative edge weights.
Floyd-Warshall
All-pairs shortest paths.
Kruskal's Algorithm
Minimum spanning tree via union-find.
Prim's Algorithm
Minimum spanning tree via greedy growth.
Cycle Detection
Detect cycles in directed and undirected graphs.
Connected Components
Find connected subgraphs.
Bipartite Graph Check
Two-coloring with BFS/DFS.