Description: Dinger undirected graph Sklar---- dijkstra shortest path is to help students complete the Project, the teacher asked foreigners really different. For the basic algorithm, not only asked not to use the advanced containers, also called the inspection program has a certain error capacity. It took 1 day of time to finish, the code takes into account node issue too much memory, so by mapping relationship matrix stored. The resulting drawback is to find a node to determine when the need for recycling, resulting in low efficiency. In short, the efficiency of memory usage and process fish and can not have both. Comparison of writing messy code. For reference only. Project requirements description reference links: http://hi.baidu.com/yiyiyis/blog/item/1d12842a6ae51c21d52af1d0.html?timeStamp=1292219252654
To Search:
File list (Check if you may need any files):
说明.txt
源码\Dijkstra.cpp
....\Dijkstra.dsp
....\Dijkstra.dsw
....\Dijkstra.ncb
....\Dijkstra.opt
....\Dijkstra.plg
Dijkstra.exe
test.txt
源码
Download