Skip to content

A maze solver using depth first search. I borrowed an algorithm for finding the shortest paths between nodes in a graph (A* -> Dijkstra's algorithm).

Notifications You must be signed in to change notification settings

MSoup/ExitMaze-FloodFill

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 

About

A maze solver using depth first search. I borrowed an algorithm for finding the shortest paths between nodes in a graph (A* -> Dijkstra's algorithm).

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages