Skip to content

Pathfinding algorithms #3260

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
Closed
Rolv-Apneseth opened this issue Oct 13, 2020 · 3 comments
Closed

Pathfinding algorithms #3260

Rolv-Apneseth opened this issue Oct 13, 2020 · 3 comments

Comments

@Rolv-Apneseth
Copy link
Contributor

Hi, just wondering if adding some pathfinding algorithms implemented in python would be something I could contribute to this project? I have experience with these as I have built a pathfinding algorithm visualiser using pygame (repo here: https://github.com/Rolv-Apneseth/pathfind-visualiser)
@NumberPiOso
Copy link
Contributor

Nice repo!

This kind of algorithms, like A* and Greedy algorithms are included in searches section.

I suppose they would belong there.

@Rolv-Apneseth
Copy link
Contributor Author

Ok, so should I do it as a grid of nodes which is printed to the console or it returns a path or what is best

@Rolv-Apneseth
Copy link
Contributor Author

Or just an int of the shortest path length?

This was referenced Oct 21, 2020
Closed
Closed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@NumberPiOso @Rolv-Apneseth