The document discusses the shortest-route problem of finding the optimal path between a source and destination node in a network. It describes an algorithm to solve this problem by constructing a list of branches between nodes with their lengths, arranging them by ascending length, and then iteratively selecting the shortest remaining branch to determine the shortest route between the source and each subsequent node.

1. The Shortest-Route Problem + Trying to find the shortest route from a source or a destination through a connecting network + The destination may be in any other node in the network. + This the problem faced by any organization that delivers or picks up material from a number of points.

2. Shortest-Route Algorithm Construct a list for each node in the network of the branches leading out of that node. Each branch is identified by a two-letter symbol; 1st letter is the node a branch leaves from and The 2nd letter is the node it goes to. Directly beside the symbol indicate the length of that branch. Arrange the branches in ascending order of the branch lengths. Table 16-10 BRANCHES LEADING OUT OF EACH NODE IN SHORTEST-ROUTE NETWORK

3. Step 1. Identify branches that lead away from the origin. Select which of the branches is the shortest.

4. Step 2. Choose the 2nd nearest nodes to the Origin , those nearest A and B.

5. Step 3. Choose the 3rd nearest nodes to the Origin, those nearest B and C

6. Step 4. Choose the 4th nearest route from the Origin, those Nearest C and D

7. Step 5. Choose the 5th Nearest node from Origin, those nearest D and E. 200 150