Jump to content

iknownothing

New Members

  • Joined

  • Last visited

View Profile Find content

Everything posted by iknownothing

  1. iknownothing

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

    iknownothing posted a topic in Computer Science
    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?

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.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.