My goal was to understand tree traversal algorithms as I've rarely touched them since university so I quickly wrote up one that interested me and wrote it for building a unique maze. You can test it out at https://sacert.github.io/Prim-s-Maze/
-
Notifications
You must be signed in to change notification settings - Fork 0
Quick implementation of prim's algorithm
sacert/Prim-s-Maze
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Quick implementation of prim's algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published