Dijkstra's algorithm to find all the shortest paths possible

Posted by Darksody on Stack Overflow See other posts from Stack Overflow or by Darksody
Published on 2010-05-12T13:45:15Z Indexed on 2010/05/12 13:54 UTC
Read the original article Hit count: 340

Filed under:
|
|

Hello, I'm working on Dijkstra's algorithm,and i really need to find all the possible shortest paths,not just one.I'm using an adjacency matrix and i applied Dijkstra's algorithm,and i can find the shortest path.But i need to find all the paths with that minimum cost,i mean all the possible solutions,if they exist.If anyone have an ideea and can help me,i would really appreciate it.A link would be fine too.

Thank you.

© Stack Overflow or respective owner

Related posts about dijkstra

Related posts about all