Hi,<br><br><div style="text-align: left;">I would like to know if somebody could help me with Graphs. I need to find the 10th or kth shortest path in a single source problem, weighted &gt;0, in other words, I need to keep the 10th or more first paths of one source to all other vertexes. I had already done that using a K shortest path algorithm (Yen, <a href="http://code.google.com/p/k-shortest-paths/">http://code.google.com/p/k-shortest-paths/</a> ),which discovery all the paths of a source to a sink, and I had just used a &quot;for&quot; with an objective to try all the sink nodes to solve the problems to all vertexes. It works, but the problem is that I can&#39;t use it in a big graph with 500 000 nodes, problems with memory. And now I am trying to use the boost library to compute  at least the 10th shortest path to all nodes from a sink, but I don&#39;t know how can I keep the other paths. Attached: graph_al.cpp that is the code of boost library to compute a single source shortest path with dijkstra and pseudo_code that I was thinking to use to storage the other paths, but I don&#39;t know how to use it in a complex code like dijkstra boost code. If someone could help me ? <br>
<br>thank you in advance.<br></div><br>Alexandre de Lima<br>