Seek Shortest Path Using Size Increment
Meng Xiang-qin · Journal of Hebei Fnergy Institute of Vocation and Technology · 2002
It is widely used to seek shortest path in graph theory of computer technology. Generally , the method for solving the problem is the one that is put forward by Dijkstra using the sequence of increment size . However , it will become more easier if a form is adopted in the same method of calculation .