search

sraaphorst / spelunker

Maze generation and solving library
Other
11 stars 2 forks source link

Implement DFS, BFS, Kruskal, and Prim for GraphMaze #67

Open sraaphorst opened 6 years ago

sraaphorst commented 6 years ago

We should be able to implement at least four algorithms, namely:

  1. DFS

  2. BFS

  3. Kruskal

  4. Prim

using the Boost.Graph algorithms. I'm unsure if these will work , as they may be deterministic, in which case, they will give consistent results, which is not what we want.