This site requires JavaScript, please enable it in your browser!
Greenfoot back

Report as inappropriate.

firedark60 presents ...


Depth First Search Maze & Dijkstra's algorithm Example/Demonstration

My personal version of the Depth-first search algorithm maze generator :) This version of DFS uses back-tracing.

If you hit run again, the computer solves for the shortest method using Dijkstra's algorithm. Solver created by Ethan Li. Find him:

5866 views / 863 in the last 7 days

1 vote | 0 in the last 7 days

Tags: game simulation physics demo maze first search algorithm depth dijkstra

open in greenfoot
Your browser does not support the canvas tag.


Awesome work guys!


why havent u used quick-union or quick-find algorithm for the maze solution? Dijkstra seems too "top-level" for solving a maze to me.

Want to leave a comment? You must first log in.

Who likes this?