This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4. If all nodes are connected, stop. Otherwise continue with step 3 iteratively. (This is Prims algorithm. Can also use Kruskals choose shortest edges while not getting cycle until all nodes are connected.) Shortest Route Goal: minimize total distance from source node to series of destination nodes. 1. Find the nearest node to origin. (Record distance in box near the node.) 2. Find the next-nearest node to origin. (Record distance in box near the node.) 3. Repeat until all nodes have been visited. The distance at the ending node is the length of the shortest route; the distance placed at each node is the shortest route to that node....
View Full Document
- Spring '10