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

Optimize Shortest Paths Between Vertexes #18

Open
joshheinrichs opened this issue May 29, 2015 · 1 comment
Open

Optimize Shortest Paths Between Vertexes #18

joshheinrichs opened this issue May 29, 2015 · 1 comment
Labels
optimization

Comments

@joshheinrichs
Copy link
Owner

Currently, all vertexes are finding the shortest path to all other vertexes using Djikstra's algorithm. This means that it has a O(n^3log(n)) running time. This can be reduced down to O(n^2).
@joshheinrichs joshheinrichs changed the title Optimize Shortest Paths Optimize Shortest Paths Between Vertexes May 29, 2015
@joshheinrichs
Copy link
Owner Author

Probably not relevant for the moment, since only point to point distance is required. This feature will likely be cut.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
optimization
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@joshheinrichs