Introducing graph theory, including representations (adjacency list/matrix), and fundamental traversal algorithms like BFS and DFS.
Comparing and implementing adjacency lists and adjacency matrices.
A graph traversal algorithm that explores neighbor nodes first, before moving to the next level neighbors.
A graph traversal algorithm that explores as far as possible along each branch before backtracking.
Determining if a graph's vertices can be divided into two disjoint sets.