The Student Room Group

How to modify Dijkistra's algorithm to determine the path of an electric car?

Let's say that I wanted to determine whether or not an electric car can travel to every "city" on a weighted graph, undirected, given some limited number of recharges. Can this be solved with Dijkistra's algorithm? NOTE, the problem does not specify that the car returns to its original city (as someone suggested to me that it may be a traveling salesman problem). Can Djikistra's algorithm be used to solve this problem?

Quick Reply