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

Create bi_directional_dijkstra.js #1525

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

100mya
Copy link

@100mya 100mya commented Oct 13, 2023

bi directional dijkstra code in javascript using backtracking

Copy link
Collaborator

@appgurueu appgurueu left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  • Interface-wise, shouldn't this take a single graph (the "forward" representation), and generate the "backward" representation from that?
  • Implementation-wise, you manage parent arrays, but you do not seem to use them for finding paths; you just return the distance. Can the parent arrays safely be removed, or are you planning to add code to find paths?
  • The example should be moved to a proper test.

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

2 participants