A perfect maze, by definition, is path-connected and loop free. It is equivalent to a spanning tree on a graph in which nodes are blocks in a grid and edges are up/down/left/right adjacencies. Anyway, I drew one with OpenGL/GLUT for Computer Graphics class.
nathanbreitsch/maze
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
A perfect maze, by definition, is path-connected and loop free. It is equivalent to a spanning tree on a graph in which nodes are blocks in a grid and edges are up/down/left/right adjacencies. Anyway, I drew one with OpenGL/GLUT for Computer Graphics class.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published