Implementing of the Shortest Path's Dijkstra by Mark- Method
Ren Jian-jun · 2003
The shortest path problem(also called lowerest expanse problem) is widely applied at computer's graphic,data - structure and data communication fields and so on. This text has mainly analysed and improved on DIJKSTRA arithmatic to apply cupidity arithmatic.