<div>
<a href="http://www.dis.uniroma1.it/~challenge9/papers/santos.pdf" rel="ugc">http://www.dis.uniroma1.it/~challenge9/papers/santos.pdf</a><br />
<br />
Implementation of K-shortest Path Dijkstra Algorithm used in All-optical Data Communication Networks<br />
<a href="http://www.u.arizona.edu/~saurabh/SIE/kDijkstra546.pdf" rel="ugc">http://www.u.arizona.edu/~saurabh/SIE/kDijkstra546.pdf</a>
</div>


http://www.dis.uniroma1.it/~challenge9/papers/santos.pdf [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 [http://www.u.arizona.edu/~saurabh/SIE/kDijkstra546.pdf]

<div>
Realy, thanks a lot.<br />

</div>


<div>
Glad to help :)<br />
<br />
Was wondering why you chose a B grade. Pls refer to grading guidelines here<br />
<a href="https://www.experts-exchange.com/help.jsp#hi403" rel="ugc">https://www.experts-exchange.com/help.jsp#hi403</a>
</div>


Glad to help :)

Was wondering why you chose a B grade. Pls refer to grading guidelines here
https://www.experts-exchange.com/help.jsp#hi403 [https://www.experts-exchange.com/help.jsp#hi403]

<div>
<div class="content wysiwyg-content">
Hi.<br />
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 &amp;&nbsp;3rd shortest path, using the same algorithm or something else, always by using language C. Do you have any idea how to do it??<br />
<br />
<a href="http://www.cs.bham.ac.uk/~mhe/foundations2/node113.html" rel="ugc">www.cs.bham.ac.uk/~mhe/foundations2/node113.html</a>&nbsp;- 16k - <br />
(my code is similar to &nbsp;the code of the above link)
</div>
</div>


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)

k-shortest path implementation with C language

C is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations. By design, C provides constructs that map efficiently to typical machine instructions, so it has found lasting use in applications that had formerly been coded in assembly language, including operating systems as well as various application software for computers ranging from supercomputers to embedded systems. It is distinct from C++ (which has its roots in C) and C#, and many later languages have borrowed directly or indirectly from C.