搜索资源列表
逢山开路模型
- 在本问题的求解中，修桥和挖隧道是两个相类似的求解过程，我们将求解过程分为两个部分：第一、对河岸边一固定点 ，将桥修在 处时，求解由起始点 到经固定点 到居民点 的最短路线。第二、如何确定 的位置，使得总路线的费用最小。我们分别用了两个模型来进行这两部分内容的求解。模型一、针对坡度的限制，利用小区域内的局部最优来达到全局最优。模型二、列出点 有一定的位移时，可以减少的费用 的函数方程，然后利用河岸附近等高线较紧密，公路不能沿偏离等高线方向前进的特性，求出减少的费用 的条件极值，从而确定最佳修桥地点
GraphAlgorithm
- 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
贪婪算法－单源最短路径
- 贪婪算法最短路径实现。单源最短路径-greed to achieve the shortest path algorithm. Single-source shortest path. .
19832002
- java编写的applet小应用程序，是最短路径的算法演示程序。界面是英文的。-java applet prepared by the small applications, is the shortest path algorithm demonstration program. The interface is in English.
AlogortithmsExperiment
- 在eclipse下开发的求平面上两点之间的最短距离。通过随机在平面上生成无数个点，求其中两点间的最短距离，以及这两点。-the eclipse under development for the plane between two points is the shortest distance. Through random plane generated numerous points, two points for the shortest distance, and these two p
ProcessCall
- 操作系统中的进程调度，进程调度模拟程序：假设有10个进程需要在CPU上执行，分别用：先进先出调度算法；基于优先数的调度算法；最短执行时间调度算法 确定这10个进程在CPU上的执行过程。要求每次进程调度时在屏幕上显示：当前执行进程；就绪队列；等待队列 -operating system process scheduling, process simulation scheduling procedures : Assuming a 10 CPU in the process of impl
zuiduanlujingssss
- 这实一个求最短路径的实验，对初学者很有用，特别实学习 数据结构的同学-This is a shortest path experiment, very useful for beginners, in particular data structure is learning students
50402417
- 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trai
BestWay1
- 最短路径算法的一种高效实现。适合在节点密集的环境中找两点之间的最短路径。-shortest path algorithm to achieve a highly efficient. Suitable for the node-intensive environment between 2:00 find the shortest path.
KShortestPaths.rar
- K-shortest算法实现，采用Java语言，能根据不同的拓扑找到k条最短路径。非常经典。,K-shortest algorithm using Java language, can be found according to different topological k be the shortest path. Very classic.
shortest-way-java.rar
- 分支限界法 单源最短路径问题的 JAVA实现 3个源文件,Branch and bound method single-source shortest path problem JAVA realization of 3 source files
JAVA
- 在城市智能交通中,经常会用到最短路径的问题,比如找最佳的行车路线等,Dijkstra算法做为最经典的求解方法,为我们指明了方向.不过真正想让我了解该算法的原因是在学习ICTCLAS的N-最短路径算法。-Intelligent Transportation in the city, often used the issue of the shortest path, for example, to find the best travel routes, Dijkstra s algorithm
Shortest-path-algorithm
- 这是一个用Java编写的最短路算法，很实用。-It is written in Java using a shortest path algorithm is very practical.
RockAndRoll
- Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be f
Dijkstra
- This code is used to find shortest path using Dijkstra algorithm
shortestpath
- shortest path between two nods in network
shortest
- Shortest path algorithm implementation
Shortest-path-algorithm
- shortest path algorithm
Two-techiniques-for-finding-shortest-path
- "Two techiniques for finding shortest path" is a IEEE project and i giva a sample code for that project.
solve-shortest-path-problem
- 用JAVA实现地图最短路径问题,一个简单的模拟城市路线地图，编写程序实现：给出任意两个城市，算出用时最短的路线-Using JAVA map shortest path problem