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

Refactor path_finding.floyd_warshall #110

Open
Luke-Poeppel opened this issue Apr 15, 2021 · 0 comments
Open

Refactor path_finding.floyd_warshall #110

Luke-Poeppel opened this issue Apr 15, 2021 · 0 comments
Assignees
@Luke-Poeppel
Labels
Improvement Improvement to speed or code complexity

Comments

@Luke-Poeppel
Copy link
Owner

It would be more useful to have the adjacency matrix building stage encapsulated in its own function, especially as this will be used in other path-finding algorithms. Vectoring this encapsulated portion of the code might also help with speed (see #103).
@Luke-Poeppel Luke-Poeppel added the Improvement Improvement to speed or code complexity label Apr 15, 2021
@Luke-Poeppel Luke-Poeppel self-assigned this Apr 15, 2021
@Luke-Poeppel Luke-Poeppel added this to the v1.0.0 milestone Jul 3, 2021
@Luke-Poeppel Luke-Poeppel mentioned this issue Jul 4, 2021
Merged
7 tasks
@Luke-Poeppel Luke-Poeppel removed this from the v1.0.0 milestone Jul 5, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@Luke-Poeppel Luke-Poeppel

Labels
Improvement Improvement to speed or code complexity
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Luke-Poeppel