| Adjacency List vs Adjacency Matrix | concept | 3 | Open |
| Bellman-Ford and Negative Edges | concept | 3 | Open |
| BFS and Unweighted Shortest Paths | concept | 3 | Open |
| Bipartite Matching via Max Flow | concept | 3 | Open |
| Connected and Strongly Connected Components | concept | 3 | Open |
| DFS and the Edge Taxonomy | concept | 3 | Open |
| Dijkstra's Algorithm | concept | 3 | Open |
| Edmonds-Karp, Capacity Scaling, Push-Relabel | concept | 3 | Open |
| Floyd-Warshall and DP Shortest Paths | concept | 3 | Open |
| Graph Problem Recognition | concept | 3 | Open |
| Kruskal with Union-Find | concept | 3 | Open |
| Learning Resources | resource | 3 | Open |
| Max Flow and Ford-Fulkerson | concept | 3 | Open |
| Max-Flow Min-Cut Duality | concept | 3 | Open |
| MST Variants and Applications | concept | 3 | Open |
| MST, Cut Property, and Cycle Property | concept | 3 | Open |
| Prim with Priority Queue | concept | 3 | Open |
| Reading Guide | other | 3 | Open |
| Reference and Selective Reading | reference | 3 | Open |
| Representing Special Graphs | concept | 3 | Open |
| Shortest Path Problem Variants | concept | 3 | Open |
| Topological Sort and DAG Algorithms | concept | 3 | Open |
| What a Graph Is | concept | 3 | Open |