Algorithm Problem Set

1. Implement breadth-first search on an adjacency list and return the shortest path length between two nodes.

2. Use depth-first search to detect a cycle in a directed graph.

3. Compare the memory use of BFS and DFS on a wide, shallow graph.