Want to protect your cyber security and still get fast solutions? Ask a secure question today.Go Premium

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 1052
  • Last Modified:

find K-Shortest paths

please help?
I have a graph, I need to find the k shortest paths between node A and node B, I can find the shortest path using Dijkstra but not the k shortest paths, if you can refer me to Java code or to Yen psedocode please
thank u
0
bourou
Asked:
bourou
  • 2
2 Solutions
 
dttriCommented:
 The project home page is:
http://www-sop.inria.fr/mascotte/mascopt/
  And it is open source, so you can view the source for the problem you need.
0
 
bourouAuthor Commented:
Hi, dttri, I have looked at the way they find the k shortest paths, unfortunatly it fails in certain cases as they remove a path from the graph and search again see this example if you find the path form A to B  ACDB  and destroy it
you will not find path ACD and ADB

             C
         -   -    -
     -       -       -
  -          -          -
A           -             B
  -          -         -
     -       -      -
        -    -    -
            D
thank u dttri, if you find anything else let me know
0

Featured Post

What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now