文件名称:追查ZhuiCha_com网络技术 追查网络技术论坛.files
- 所属分类：
- SQL Server数据库
- 资源属性：
- [JavaScript] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 23kb
- 下载次数：
- 0次
- 提 供 者：
- 林*
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
（2） 主要算法的基本思想：
从题目上来分析我认为这是一个图的最短路径问题。因此决定用Dijkstra算法按路径长度递增的顺序逐步产生最短路径的方法：设置两个顶点的集合T和S，集合S中存放已找到的最短路径的顶点，集合T中存放当前还未找到的最短路径的顶点。初始状态时，集合S中只包含源点V0，然后不断从集合T中选取到顶点V0路径长度最短的顶点加入到集合S中，集合S中每加入一个新的顶点U，都要修改顶点V0到集合T中剩余顶点的最短路径长度值，集合T中各顶点新的最短路径长度值为原来的最短路径长度值与顶点U的最短路径长度只值中的较小的。此过程不断重复，直到集合T的顶点全部加入到集合S为止。
-(2) the principal on the basic idea : onto analysis from the topics I think this is a map of the shortest path problem. It decided to use Dijkstra algorithm by increasing the path length of the order gradually emerge from the shortest path approach : set up two vertices of the pool T and S, S storage pools have found the shortest path to the peak, Set T has not kept current to find the shortest path to the peak. Initial state, the pool S contain only source V0. and then from the pool of selected T vertex V0 shortest path length of the apex into pools S, S pool each add a new peak U, vertex V0 be changed to pool the remaining vertices T is the shortest path length value, Set T vertices new shortest path length of the original value of the shortest path length and value of the vertex U short
从题目上来分析我认为这是一个图的最短路径问题。因此决定用Dijkstra算法按路径长度递增的顺序逐步产生最短路径的方法：设置两个顶点的集合T和S，集合S中存放已找到的最短路径的顶点，集合T中存放当前还未找到的最短路径的顶点。初始状态时，集合S中只包含源点V0，然后不断从集合T中选取到顶点V0路径长度最短的顶点加入到集合S中，集合S中每加入一个新的顶点U，都要修改顶点V0到集合T中剩余顶点的最短路径长度值，集合T中各顶点新的最短路径长度值为原来的最短路径长度值与顶点U的最短路径长度只值中的较小的。此过程不断重复，直到集合T的顶点全部加入到集合S为止。
-(2) the principal on the basic idea : onto analysis from the topics I think this is a map of the shortest path problem. It decided to use Dijkstra algorithm by increasing the path length of the order gradually emerge from the shortest path approach : set up two vertices of the pool T and S, S storage pools have found the shortest path to the peak, Set T has not kept current to find the shortest path to the peak. Initial state, the pool S contain only source V0. and then from the pool of selected T vertex V0 shortest path length of the apex into pools S, S pool each add a new peak U, vertex V0 be changed to pool the remaining vertices T is the shortest path length value, Set T vertices new shortest path length of the original value of the shortest path length and value of the vertex U short
相关搜索： 图的最短路径
(系统自动生成,下载前可以参看下载内容)
下载文件列表
追查ZhuiCha_com网络技术 追查网络技术论坛.files
..............................................\0003.gif
..............................................\1643.js
..............................................\bbsbottom.files
..............................................\...............\show_ads.js
..............................................\bbsbottom.htm
..............................................\bbsleft.files
..............................................\.............\show_ads.js
..............................................\bbsleft.htm
..............................................\bbsmid.htm
..............................................\blank.gif
..............................................\face11.gif
..............................................\gooad468x60.files
..............................................\.................\show_ads.js
..............................................\gooad468x60.htm
..............................................\home.gif
..............................................\level10.gif
..............................................\LOGO.gif
..............................................\message.gif
..............................................\newanc.gif
..............................................\newpoll.gif
..............................................\null(1).gif
..............................................\null.gif
..............................................\OfMale.gif
..............................................\reanc.gif
..............................................\signature.gif
..............................................\splt.gif
..............................................\style0.css
..............................................\0003.gif
..............................................\1643.js
..............................................\bbsbottom.files
..............................................\...............\show_ads.js
..............................................\bbsbottom.htm
..............................................\bbsleft.files
..............................................\.............\show_ads.js
..............................................\bbsleft.htm
..............................................\bbsmid.htm
..............................................\blank.gif
..............................................\face11.gif
..............................................\gooad468x60.files
..............................................\.................\show_ads.js
..............................................\gooad468x60.htm
..............................................\home.gif
..............................................\level10.gif
..............................................\LOGO.gif
..............................................\message.gif
..............................................\newanc.gif
..............................................\newpoll.gif
..............................................\null(1).gif
..............................................\null.gif
..............................................\OfMale.gif
..............................................\reanc.gif
..............................................\signature.gif
..............................................\splt.gif
..............................................\style0.css