Unformatted text preview: 4. If all nodes are connected, stop. Otherwise continue with step 3 iteratively. (This is Prim’s algorithm. Can also use Kruskal’s – 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
This note was uploaded on 08/01/2010 for the course BUS 5865 taught by Professor Smith during the Spring '10 term at CUNY Baruch.
- Spring '10