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

Can I use the Dijkstra function to generate a shortest path tree if no target is specified #71

Open
peter-hon opened this issue Jan 24, 2018 · 1 comment

Comments

@peter-hon
Copy link

Hi,
As I want to generate a shortest path tree, can I use the the Dihkstra function in goraph to generate a shortest path tree if I do not specified the target node.

@sorenvonsarvort
Copy link

sorenvonsarvort commented Apr 15, 2018

Hey,
It seems like the Dijkstra function stops execution when it finds the target.

if u.id == target { break }

So, the algorithm in the package needs some modifications to generate the tree.

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

No branches or pull requests

2 participants