Network generation using the Prufer code (Q1088882)

This paper describes the development and implementation of an interactive program for generation of generalized (e.g. maximum flow, minimum cost flow, shortest path), tripartite (i.e. transshipment) and bipartite (i.e. transportation and assignment) network problems. The generator is based on the Prufer code which is a numeric code that uniquely characterizes a tree. It has been implemented in BASIC on the IBM PC and makes extensive use of data structures and subroutines in order to promote modularity.