What kind of algorithm would allow me to find the least amount of steps(traversing 1 edge is 1 day) to take to reach a certain vertex however if the car runs out of petrol than you would need to rest 1 day at that place.
Asked
Active
Viewed 24 times
0
-
Possible duplicate of [Find the shortest path in a graph which visits certain nodes](http://stackoverflow.com/questions/222413/find-the-shortest-path-in-a-graph-which-visits-certain-nodes) – Zoran Pavlovic Feb 07 '16 at 12:44
-
that question has a restriction on nodes to visit =/ – Bob Dylan Feb 08 '16 at 01:19
-
Please elaborate on your question. Does travelling to each vertex have the same weight as every other, or is it weighted? – Zoran Pavlovic Feb 12 '16 at 12:12