a homeschooling blog about Simon, a young mathematician and programmer, and his little sister Neva. Visit https://simontiger.com
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
“I have first built a maze, then I turned it into a graph and applied Dijkstra’s pathfinding algorithm!” Simon learned this from the Computerphile channel. He later also attempted to … Continue reading Dijkstra’s pathfinding algorithm
Geeks out of the box 