A PROGRAMMING TECHNIQUE FOR GENERATING MINIMAL PATHS A GENERAL NETWORK

This paper presents a heuristic technique for deducing minimal paths o f a network. It generates only minimal paths, without explicitly deter mining whether or not a path is minimal This technique has been implem ented on a digital computer to generate a minimal path matrix. It term s of computational speed, the results obtained compare well with exist ing algorithms. The technique requires minimum storage in memory and m inimum user-defined data to represent the topology of a network and fo llows a modular design strategy. Use of the algorithm is illustrated b y examples.