#Graphs

Graph Traversals: Node Exploration, Matrices, and Shortest Paths

Understand adjacency list representations versus matrices, Breadth-First Search (BFS) shortest paths, and Depth-First Search (DFS) topological sorting.