搜索资源列表
北京交通大学校园旅游导航系统
- 北京交通大学校园旅游导航系统，利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
cibidiaodu
- 有多个访盘要求在等待时对这些要求的顺序的确定安排或调整，只在减少平均磁盘服务时间就成为磁盘调度，而磁盘调度有多种的调度算法，其中最短路径优先是其中基本一种，本课程设计是使用C++程序设计语言，在windows平台下对此调度算法进行模拟，通过此调度算法的模拟来进一步的加深对磁盘最短路径优先调度的了解，及对C++程序设计语言的使用。 关键词：磁盘调度 最短路径优先 操作系统 课程设计 -set to visit a number of requests waiting for the rig
MySeg
- 最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图，然后使用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。-shortest path method participle procedures. Chinese Sentence will be read after splitting atoms generated a directed acyclic graph. then use the Dijkstra algorithm derived from the s
shortestroadsearch
- 求解最短路径的各种算法，包括dijstra、floyd等，用dilphi编写，稍有不成熟之处，还望批评指正-solving the shortest path algorithm, including dijstra, floyd. dilphi prepared with a little premature's Office, also criticized the correct look
shortNetwork
- 本程序为最短路径的Ｃ源程序，算法简单，执行效率高-the procedures for the shortest path to the C source, the algorithm is simple, high efficiency
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 edges, and each side has a corre
Floyd
- Floyd最短路径算法的MATLAB程序，经过测试
theShortestPath
- 最短路径算法的C语言实现，采用了尾递归的方法，时间效率很高。
XShortest.rar
- 最短路径的并行算法 采用TBB 需要intel编译器 速度很快,Parallel shortest path algorithm required the use of TBB fast intel compiler
Graph
- 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorith
managemant_enquire
- 传统的Dijkstra 算法无疑是解决一般最短路径问题的最优算法，但接下来我们会看到传统的Dijkstra 算法在公交查询系统是不适合的。而我据对公交乘客出行心理调查的统计结果,指出换乘次数最少是乘客出行时考虑的首要因素，所以这里提出一种基于换乘次数最少的公交最短路径算法。 至于公交车的调度，需要同时考虑到公车公司和乘客的利益，必须尽量在满足双方的利益上做出合理的调度。所以这是一个多目标最优的问题。- management
suanfa
- 最短路径算法的各种程序源码 需要的拿-Shortest path algorithm
dijkstra
- c++版本的最短路径算法 希望能帮到帮到初学者 里面有解释-the version of c++ the shortest path algorithm hope that help to help beginners which explained
Floyd
- 对最短路径算法的研究，是matlab的，用于研究最短路径算法-Study on the algorithm of the shortest path, matlab algorithm for the shortest path,
MINROUTE
- 用于解决最短路径问题的算法被称做“最短路径算法”， 有时被简称作“路径算法”。 最常用的路径算法有： Dijkstra算法-The shortest path algorithm is used to solve the problem is called the " shortest path algorithm," sometimes referred to as a " path algorithm." The most common path al
Dijkstras---Copy
- 最短路径算法，读取txt获得路线图，自动计算最短路径。-The shortest path algorithm, read txt get roadmap automatically calculate the shortest path.
chengshijiaotonghuancheng
- 最短路径算法，含示例文件及格式说明，原来是参加大赛写的程序 -The shortest path algorithm, including sample files
MapReduce_SSSP
- MapReduce框架实现的单源最短路径算法(SSSP, Single-source Shortest Path)，包含源文件及数据。sssp.c是MapReduce实现，ss seq.cpp是串行的普通实现。-An implementation of single-source shortest path with MapReduce framework. Contains source code and dataset. In the folder, sssp.c is the MapRed
遗传算法
- 此程序为TSP问题的遗传算法，程序可以完美运行，计算最短路径。(This procedure for the TSP problem by genetic algorithm, the program can run perfectly, the shortest path calculation.)
Dijkstra迪捷斯特拉算法
- 迪杰斯特拉算法是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。(The Dijkstra algorithm is the shortest path algorithm from one vertex to the other vertices, and the shortest path problem in the directed graph is solved. The main featur