그래프

Shortest path algorithms (Dijkstra, Bellman-Ford) and BFS-based state-space search illustrated with the sliding puzzle problem.

How a single depth-first walk unravels every cycle in a directed graph, without ever looking back.