Analysis of the Shortest Route in Network on Dijkstra Algorithm
Liu Wei-qun · Microcomputer applications · 2004
The shortest route analysis is one of the fundamental functions in network analysis. Dijkstra Algorithm is an acknowledged better algorithm of shortest route.In this paper, Dijkstra algorithm is modified by using binary tree structure through analyzing Dijkstra Algorithm's executing speed,which has optimized the calculation process in some degree and improved the efficiency of analysis.This algorithm is feasible by testing some data.