Tag: Pathfinding algorithm

By Geeks out of the Box Posted on

Pathfinding algorithms: Dijkstra’s and Breadth-first search

The photos below show Simon playing with Breadth-first search and Dijkstra’s algorithms to find the most efficient path from S to E on a set of graphs. The two more … Continue reading Pathfinding algorithms: Dijkstra’s and Breadth-first search