Applications covers connected components and shortest paths. Advanced combines distances and scheduling in an evacuation problem. Each guide includes the original problem link, an interactive experiment, and solution code.

Applications 2

1. #BOJ 2667

   Ice trays and connected components

   From filling zeros to grouping houses: compare BFS and DFS on the same grid.

2. Programmers 1844

   Game Map Shortest Path

   Watch BFS distances and the queue to see why the first route to the goal is shortest.

Advanced 1

1. #POJ 3057

   Minimum time to evacuate a room

   Combine BFS distances with DFS bipartite matching when each door admits one person per second.