SHORTEST COXXECTIOX NETWORKS 



1399 



5(a). (A distance table can also be prepared to represent an incomplete 

 labelled graph by entering the length of non-existent edges as oo .) 



When it is desired to determine a shortest connection network directly 

 from the distance table representation — either manually, or b}^ machine 

 computation — one of the numerous particular algorithms obtainable 



Fig. 9 — Di.stance table equivalent of Figs. 4(a) and 5(a). 



2 3 5 6 



4 7.3 3.4 8.0 4.4 



5.7 



3.2 



2 5.1 



2 5 6 



8.5 



2 5 



4.6 



4.0 



Fig. 10 — Illustrative computational determination of a shortest connection 

 network. 



