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.

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

pgr_binaryBreadthFirstSearch GSOC-2019 week 7 #18

Merged
merged 7 commits into from Jul 14, 2019

Conversation

vicennial
Copy link
Contributor

@vicennial vicennial commented Jul 14, 2019

  • Added path-cost calculation to the algorithm.
  • Replaced usage of a C++ STL map container with a C++ STL vector container. (Vector container has a lower runtime complexity compared to map container for accessing stored elements)
  • Refactored the path-generation and cost-calculation sections of the algorithm into multiple, easy-to-read modules.
  • Added a pre-processing check that verifies that the input graph satisfies the restrictions set by the algorithm which are required to be followed for successful execution. An error is thrown if restrictions are not met.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

1 participant