Dijkstra shortest path algorithm with edge cost.

Posted by Svisstack on Stack Overflow See other posts from Stack Overflow or by Svisstack
Published on 2010-04-26T00:23:54Z Indexed on 2010/04/26 1:03 UTC
Read the original article Hit count: 312

Filed under:


I have a directed, positive weighted graph. Each edge have a cost of use. I have only A money, i want to calculate shortest paths with dijkstra algorithm, but sum of edges costs on route must be less or equal to A.

I want to do this with most smallest Dijstra modification (if I can do it with small modification of Dijkstra).

Anyone can help me with this?

© Stack Overflow or respective owner

Related posts about algorithm