Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

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

Open
sraaphorst opened this issue Jun 13, 2018 · 0 comments
Open

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

sraaphorst opened this issue Jun 13, 2018 · 0 comments
Labels
enhancement New feature or request graphmaze Mazes based on Boost.Graph optional Optional feature: may not implement

Comments

@sraaphorst
Copy link
Owner

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.
@sraaphorst sraaphorst added enhancement New feature or request graphmaze Mazes based on Boost.Graph labels Jun 13, 2018
@sraaphorst sraaphorst added the optional Optional feature: may not implement label Jun 23, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request graphmaze Mazes based on Boost.Graph optional Optional feature: may not implement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@sraaphorst