Creating a 100x100 maze using this algorithm should not take more than one second.
Sample times:
Running de.amr.mazes.simple.test.LargeMazeTest Prim: 1.000.000 vertices, (1464 ms) BFS: 1.000.000 vertices, (426 ms) DFS: 1.000.000 vertices, (235 ms) Wilson: 1.000.000 vertices, (1744 ms) Recursive Division: 1.000.000 vertices, (145 ms) Aldous Broder: 10.000 vertices, (95 ms) Binary Tree: 1.000.000 vertices, (54 ms) Kruskal: 1.000.000 vertices, (2563 ms) Sidewinder: 1.000.000 vertices, (89 ms) Growing Tree: 1.000.000 vertices, (1378 ms) Tests run: 10, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 15.52 sec
For many more maze algorithms see github.com/armin-reichert/mazes
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Creating a 100x100 maze using this algorithm should not take more than one second.
Sample times:
For many more maze algorithms see github.com/armin-reichert/mazes