Finding the Shortest Route between Two Points in a Network

摘要: A new method is proposed for finding the shortest route between two points in an interconnected network. The found by investigating a selection of routes from both starting point and terminal point. decided dynamically extending one which have currently covered least distance. Once complete through has been found, it to be made certain that minimum. appears more efficient than alternative approaches problem linear or dynamic programming. Some applications technique scheduling other problems are briefly described.