Skip to content

BFS and Shortest path, test with 2D array #960

New issue

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

#

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

Already on GitHub? # to your account

Jump to bottom
Open
netgfx opened this issue Jan 21, 2021 · 0 comments
Open

BFS and Shortest path, test with 2D array #960

netgfx opened this issue Jan 21, 2021 · 0 comments

Comments

@netgfx
Copy link

netgfx commented Jan 21, 2021

Brief Intro

With how it is currently implemented, how would you propose to test the BFS and/or shortest path with a multi dimension array which consists of non traversable blocks. Does one have to declare edges and neighbours for all points in the grid?

Thanks in advance!
# for free to join this conversation on GitHub. Already have an account? # to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@netgfx