Karteikarten
Dijkstra's Shortest Path
Karten in diesem Stapel (5)
- 1Step 1Pick your start point
- 2Step 2Test the length of every unchecked edge and store the distance at the corresponding node
- 3Step 3Mark the current node as complete
- 4Step 4Move to the closest node and set the shortest distance there as its final distance with the node that distance is coming from
- 5Step 5If this is not the final node, return to step 2. Otherwise, starting at your destination, follow the shortest distances back to the start for your shortest path
Informationen
- Beschreibung
- The steps for performing Dijkstra's shortest path algorithm
- Erstellt von
- Josh Calvert
- Aufrufe
- 67
- Tags
- Bewertung