Description: Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm to compute a node to all other nodes of the shortest path. Main features is the starting point for the center outward layers of extended until the extension to the end up. Dial Dijkstra algorithm is achieved through a series of methods, Dijkstra algorithm is accelerated.
To Search:
File list (Check if you may need any files):
P2P_Dijkstra\common.h
............\Debug\BuildLog.htm
............\.....\graph.obj
............\.....\mt.dep
............\.....\P2P_Dijkstra.exe.embed.manifest
............\.....\P2P_Dijkstra.exe.embed.manifest.res
............\.....\P2P_Dijkstra.exe.intermediate.manifest
............\.....\P2P_Dijkstra.obj
............\.....\P2P_Dijkstra.pch
............\.....\stdafx.obj
............\.....\vc80.idb
............\.....\vc80.pdb
............\graph.cpp
............\graph.h
............\graph.topo
............\Graph_Creator.cpp
............\P2P_Dijkstra.cpp
............\P2P_Dijkstra.vcproj
............\P2P_Dijkstra.vcproj.KEYLAB.SWT.user
............\P2P_Dijkstra.vcproj.Newway-PC.Newway.user
............\ReadMe.txt
............\stdafx.cpp
............\stdafx.h
............\Debug
P2P_Dijkstra
Download