Application of the Minimum-Weight Spanning-Tree Algorithm to Assignment of Communication Facilities
29 April 2014
CP 4-981 CP 4-982 CP 4-983 BL - B R I D G E L I F T E R CP - C A B L E PAIR TP - TIE PAIR F R A M E CONNECTION BY FRAME ATTENDENT EACH LINE IS A SCHEMATIC R E P R E S E N T A T I O N OF A PAIR OF W I R E S . Fig. 1--Example of a main line with three off-premises extensions. algorithm developed to achieve this capability and illustrates how it benefits the COSMOS user.