• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 598
  • Last Modified:

k-shortest path implementation with C language

Hi.
By using Dijkskta algorimth i have implemented an application for find the 1st shortest path of an optical network. Unfortunately, this is not enough. It is necessary to calculate the 2st & 3rd shortest path, using the same algorithm or something else, always by using language C. Do you have any idea how to do it??

www.cs.bham.ac.uk/~mhe/foundations2/node113.html - 16k -
(my code is similar to  the code of the above link)
0
tsakyr
Asked:
tsakyr
  • 3
1 Solution
 
sunnycoderCommented:
http://www.dis.uniroma1.it/~challenge9/papers/santos.pdf

Implementation of K-shortest Path Dijkstra Algorithm used in All-optical Data Communication Networks
http://www.u.arizona.edu/~saurabh/SIE/kDijkstra546.pdf
0
 
sunnycoderCommented:
Btw, you can use your existing algo too ...

Find the shortest path
second_shortest = HIGH_VALUE
for all edges in shortest path
     remove the edge
     current = find the shortest path
     second_shortest = min (second_shortest, current)
     put back edge
end for

If you iterate over this pseudocode k times - removing the edge for shortest path each time, you would have k shortest paths.
0
 
tsakyrAuthor Commented:
Realy, thanks a lot.
0
 
sunnycoderCommented:
Glad to help :)

Was wondering why you chose a B grade. Pls refer to grading guidelines here
http://www.experts-exchange.com/help.jsp#hi403
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.

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