文件名称:Dijkstra
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 186kb
- 下载次数：
- 0次
- 提 供 者：
- 方*
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
迪杰斯克拉无向图最短路径----dijkstra
这是帮同学完成的Project，老外老师的要求果然不同。对于基本算法，不光要求不能使用高级容器类，还要求程序有一定的检验错误能力。花了1天的时间写完，代码考虑结点过多内存占用的问题，因此关系矩阵采用映射的方式存储。由此带来的弊端是，找一个结点的时候需要循环判断，导致效率过低。总之，内存占用与程序效率是鱼与熊掌不可兼得。
代码写的比较凌乱。仅供参考。
Project的要求介绍参考链接：
http://hi.baidu.com/yiyiyis/blog/item/1d12842a6ae51c21d52af1d0.html?timeStamp=1292219252654-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 descr iption reference links: http://hi.baidu.com/yiyiyis/blog/item/1d12842a6ae51c21d52af1d0.html?timeStamp=1292219252654
这是帮同学完成的Project，老外老师的要求果然不同。对于基本算法，不光要求不能使用高级容器类，还要求程序有一定的检验错误能力。花了1天的时间写完，代码考虑结点过多内存占用的问题，因此关系矩阵采用映射的方式存储。由此带来的弊端是，找一个结点的时候需要循环判断，导致效率过低。总之，内存占用与程序效率是鱼与熊掌不可兼得。
代码写的比较凌乱。仅供参考。
Project的要求介绍参考链接：
http://hi.baidu.com/yiyiyis/blog/item/1d12842a6ae51c21d52af1d0.html?timeStamp=1292219252654-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 descr iption reference links: http://hi.baidu.com/yiyiyis/blog/item/1d12842a6ae51c21d52af1d0.html?timeStamp=1292219252654
(系统自动生成,下载前可以参看下载内容)
下载文件列表
说明.txt
源码\Dijkstra.cpp
....\Dijkstra.dsp
....\Dijkstra.dsw
....\Dijkstra.ncb
....\Dijkstra.opt
....\Dijkstra.plg
Dijkstra.exe
test.txt
源码
源码\Dijkstra.cpp
....\Dijkstra.dsp
....\Dijkstra.dsw
....\Dijkstra.ncb
....\Dijkstra.opt
....\Dijkstra.plg
Dijkstra.exe
test.txt
源码