A serial technique to determine minimum paths
The need to determine minimum paths through a maze very often arises in such fields as traffic, transportation, communication and network studies. Computer analysis of these maze problems has been hampered in many cases due to the excessive size of the network under consideration. A technique has been developed to handle networks of very large magnitude by serially processing the network repetitively until only minimum paths remain.