NETWORKING ANALYSIS

(SHORTEST ROUTE PROGRAM)

EXAMPLE 1
The network in the following figure shows the distance among the
seven cities. Find the shortest distance between Node 1 to Node 7.

5
2 5

2 6
11 8

10
1 4 7

3 7 9

4
1
3 6

EXAMPLE 2
Gorman has several construction projects located through the country.
With multiple daily trips carrying personnel, equipment and supplies to
and from the construction locations, the costs associated with
transportation activities are substantial. The following figure describes

1
the travel time to and from six of Gorman’s newest construction sites.
Gorman would like to determine the routes paths that will minimize the
total travel time from the office (node 1) to site 7.

25
2 7
20 12 11

1 6 4 18

16 15 5
3 5 6

Example 3
Find the shortest route between nodes 1 and 8 in the following
network.
4

3 2 5 5
2
3 2
4 8
1 3 4 2 2
2
4

7
3 6 3
5

Example 4

1
Find the shortest route between nodes 1 and 7 in the following
network .

1 4 2 8
6 3
2
2
3 4 9
7
2 J 2

3 5 5

4 8
7
Example 5
Find the shortest route from node 2 to node 6 in the transportation
network shown in the following figure.

8
2 5 6
2
3 2
1 9
3
10 7

3
18 6
4
3
Example 6
The figure shows the distance in miles between each of five delivery
locations. Find the shortest route from the home location (Node 1 ) to
each delivery location (Node 4) .
4
2 5
4 11
5 4

1
4
1
 9

16

Example 7
The network shown represents points of interest at a particular historic
village and the approximate walking time (in minutes) along certain
path ways .Assuming that Node 1 represent the main lodge, find the
shortest walking time to point 7 of interest from the main lodge and
indicate which points of interest will be encountered along that path.
10
2 5 10
4
5 4
7
24 6 8

15

12 3 7 6
1

Example 8
Find the shortest route from node 1 to node 4 in the transportation
network shown in the following figure .

5
2 5
6
3 4
7 2 7
1 9
3
18 3
6
3
4
1 3
Example 9
Gorman has several constriction projects located throughout the
country. With multiple daily trips carrying personnel, equipment and
supplies to and from the construction locations, the costs associated
with transportation activities are substantial. The following figure
describes the travel to and from six of Gorman’s newest construction
sites. Gorman would like to determine the routes or path that will
minimize the total travel time from office (node 2) to site 6.

2
2 7
5
2 4
2

4
0
1
6 3
1 4

5
1
3 7
5 6

Example 10
Find the shortest route between nodes 1 and 8 in the following
network.

2 5
5
8 3 2
6 6
7 7
1 3 4 --6 8
--
5 6
8 5
4
6 7
4
1
Example 11
Distances shown on the areas of the following network are in meters.
Find the shortest route and the distance from node 1 to node10.
2 -7
13
11

1
00
5- 00 24
15
00 00
9 16
00
1 17 3 18

1
- 8 10
00 00
10

1 1
15
16
17 1 12
00
6
15

10
20

4 12

1 1 10
9

Example 12 1
The values on the ares connecting various nodes represents the
distance between nodes in moles for the following networks. Find the
shortest route to node 5 from node 1 using the shortest route
algorithm.

2 13 5

4 10

5 3
3

5 6

1 12 4

1
1