APS.10 Dijkstra, Bellman-Ford & Sliding Puzzle

APS.10 Dijkstra, Bellman-Ford & Sliding Puzzle

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