Page 370 -

350 CHAPTER 8 NETWORK MODELS

Figure 8.8 GDA’s Network with a Permanent Label at Node 5 and New Tentative Labels
for Nodes 4 and 6

[30, 2]
7
17
[13, 3]
5
2 [18, 5] 6
6
[19, 2]
15 4

[0, S] 3 4 6
2
[16, 5]
1
10 5
4
3 [14, 3]
[10, 1]

From the tentatively labelled nodes (nodes 4, 5 and 7), we select the node with
the smallest distance value and declare that node permanently labelled. So node 5,
with a distance of 14, becomes the new permanently labelled node. From node 5,
then, we consider all non-permanently labelled nodes that can be reached directly
from node 5. Thus, the tentative label on node 4 is revised, and node 6 is tentatively
labelled. Figure 8.8 shows these.
The smallest distance is again identified for the remaining tentatively labelled
nodes, and this results in node 6 being permanently labelled. From node 6 we can
determine a new tentative label with a distance value of 22 for node 7. After this step,
the network appears as shown in Figure 8.9.

Figure 8.9 GDA’s Network with a Permanent Label at Node 6 and a New Tentative
Label for Node 7

[22, 6]
[30, 2]

7
17
[13, 3]
5
2 6
6
[18, 5]
15 4

[0, S] 3 4 6
2
[16, 5]
1
10 5
4
3 [14, 3]
[10, 1]

Copyright 2014 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s). Editorial review has
deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.