Frage | Antworten |
Step 1 | Pick your start point |
Step 2 | Test the length of every unchecked edge and store the distance at the corresponding node |
Step 3 | Mark the current node as complete |
Step 4 | Move to the closest node and set the shortest distance there as its final distance with the node that distance is coming from |
Step 5 | If 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 |
Möchten Sie mit GoConqr kostenlos Ihre eigenen Karteikarten erstellen? Mehr erfahren.