Understand adjacency list vs. adjacency matrix representations and their trade-offs. Be proficient in Breadth-First Search (BFS) for shortest path in unweighted graphs and Depth-First Search (DFS) for traversal and cycle detection.
Posts tagged with BFS
BFS
Be able to implement and explain the differences between In-order, Pre-order, and Post-order (DFS variations) and Level-order (BFS) traversals, both recursively and iteratively.