Jump to content

Can I use Djikstra's algorithm to solve this problem?


Recommended Posts

Note, this is not an assignment. Just something that I came across online. 

Say I wanted to determine if a path exists that will allow an electrical car to travel to every single city on an undirected, weighted graph, given a limited number of recharges. Note, it is not stipulated that the car ever returns to its original city (which I believe disqualifies this problem as a case of the traveling salesman). However, I do need to determine path, and path cost. Can Djikstra's algorithm be modified in order to solve this problem, and how? 

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.