搜索资源列表
Matlabzuiduanlujing
- matlab算最短路径的算法,很好用大家可以试一试-Matlab operator of the shortest path algorithm, we can use a good try
Dijkstra_TA
- 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统;输入为出发城市和目标城市, 输出为最短路径和距离。 -data structure of the classic experimental procedure. In major cities across the country to the vertex, the railway linking the ed
Flody_ShortestPath
- 在VC++环境下,实现Flody最短路径算法的演示过程,操作方便,使用鼠标点击即可.-in VC environment, the realization of the shortest path algorithm Flody the demo process, convenient operation, use a mouse click away.
Dijkstra_c
- C#中实现最短路,该图算法描述的是这样的场景:图由节点和带有方向的边构成,每条边都有相应的权值,路径规划(最短路径)算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the ed
myKbest_0513
- 中文分词, N-最短路径算法 ICTCLAS研究学习组 http://groups.google.com/group/ictclas?msg=subscribe-Chinese word segmentation, N-shortest path algorithm ICTCLAS Studies Group http :// groups.google.com/group/sub ictclas msg = scribe
BestWay1
- 最短路径算法的一种高效实现。适合在节点密集的环境中找两点之间的最短路径。-shortest path algorithm to achieve a highly efficient. Suitable for the node-intensive environment between 2:00 find the shortest path.
ksp
- 改进的Dijkstra寻径算法,用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path
Matlablowestpath
- Matlab经典算法__最短路径 比较好的,能够很好的适应各种不同情况-Matlab classical shortest path algorithm __ relatively good, very good to adapt to different circumstances
819ShortPath
- 最短路径算法,基于 地震系统 改写的最短路经算法,实现基本的功能,便于学习 -shortest path algorithm, based on the seismic system rewrite the minimum passing algorithm, achieving basic functions, ease of learning
campusNavigate
- 校园导航程序,数据结构中图的利用的典型例子(我的一次课程实验源代码),本代码用C语言编写; 基本功能: 1.校园景点信息的查询功能。 2.校园景点最短路径查询功能。(求图的最小路径)-campus navigation procedures, the data structure using the map of a typical example (I once Experimental source code), The
zhoumao
- 换乘次数最少是乘客出行时考虑的首要因素。描述了传 统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段 距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Descr iption of the
PIPE
- 算法实现题2-1 输油管道问题 « 问题描述: 某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油 田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n口油 井的位置,即它们的x 坐标(东西向)和y 坐标(南北向),应如何确定主管道的最优位置, 即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道 的最优位置。 &laq
d
- 数据结构算法的实现 7_7狄克斯特拉有向带权图最短路径-Data Structure Algorithm 7_7狄克斯特拉has the right to take the shortest path map
shorest
- dijistra最短路经算法的实现。根据以文件输入图中各个节点的距离关系,然后运用算法求出a点到b点的最短路径-dijistra realize the shortest path algorithm. According to the file input graph in each node the distance relationship, and then use algorithms to derive a point to
lujing
- 公车最短路径算法具体的算法: 实际上乘客不一定要找最短,里面还涉及到换乘次数最少,费用最少等问题 因此,边向量的权值要分多种情况考虑,所以如果真的要开发实用的系统 应该给出多种最佳选择。 -Bus shortest path algorithm specific algorithm: in fact they do not necessarily find the shortest, which also
graphic
- 用分枝界限法找图的最短路径,并显示结果。-With branch-and-bound method to find the shortest path map, and the result will be displayed.
ehotgis_shortpath
- 基于ehotgis开发的嵌入式gis最短路径应用源码-Ehotgis based on the development of embedded applications gis shortest path source
Bellman_ford
- bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford realized. Can output of each node after the shortest path
floydmatla
- 通用的floyd算法程序,能够很好地解决最短路径问题,同时给出最短路的具体路径。-Floyd algorithm universal procedures, able to solve the shortest path problem, shortest path at the same time given the specific path.
ShortPath
- 最短路径计算,比较简单的测试 可用于网上地图服务中路径分析-The shortest path calculation, a relatively simple test can be used for online mapping service in the path analysis