Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Single Destination shortest path

dppdpp Member Posts: 3
hi...i am used to and i ve implemented single source shortest path dijstra's algorithm...
shortest path from start to all the vertices...

but for same destination from many sources it will be single destination shortest path...
but how do i modify single source to single destination....

any help plzzzzz.


  • bubbatremellbubbatremell Member Posts: 39
    I'm not sure I understand you completely, but it sounds like you have already solved the problem. Just run your shortest path program with your destination as the starting point. I believe that would work provided that the distance/cost between any two points is the same in both directions.
Sign In or Register to comment.