© 1960 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
A Comprehensive Program for Network Problems
Computation Laboratory, The University, Southampton, UK
This article describes in general terms, a program which has been written for the Pegasus digital computer, which will solve several of the more common problems associated with networks having weighted branches. All operations are carried out within the incidence matrix stored serially by rows in the computer.
After a brief introduction to the concepts and terminology of graph theory, a comparison is made between the two principal ways in which a network may be represented within a computer. The discussion on the form of output after the program has transformed the incidence matrix includes a description of a tree symbol more suited to construction in a computer than those given by Prüfer and by Loberman and Weinberger.