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

dijkstra based optimization #23

Open

rochaporto opened this issue Mar 24, 2018 · 2 comments

Collaborator

rochaporto commented Mar 24, 2018

Example:
https://github.com/XCSoar/XCSoar/blob/fb18d530575a1126400554af65d3ee582d1c809a/src/Engine/Contest/Solvers/ContestDijkstra.cpp

There must be golang libraries available already.

Collaborator Author

rochaporto commented Mar 29, 2018

https://www.geeksforgeeks.org/find-longest-path-directed-acyclic-graph/

rochaporto changed the title ~~dijsktra based optimization~~ dijkstra based optimization

Collaborator Author

rochaporto commented Mar 29, 2018

Valid option for directed acyclic graphs:

apply dijkstra (shortest path) to the negative distances, which should give the longest path

It should work only on DAG, not general graphs.
https://en.wikipedia.org/wiki/Longest_path_problem

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment