Dijkstra shortest path algorithm with edge cost.
- by Svisstack
Hello,
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?