搜索资源列表
linjiebiao
- 用邻接表实现对图的编程，并且可以求出最短路径-Map with the adjacency list implementation of the programming, and can find the shortest path
Dijkstra
- 最短路径问题,迪杰斯特拉算法,图像,读取数据,linux-The shortest path problem, Dijkstra algorithm
Dijkstra(cPP)
- Dijkstr数值算法，求解网络流的最短路径算法-Dijkstr numerical algorithm for solving the shortest path algorithm for network flow
aco
- 利用蚁群算法求解tsp（旅行商）问题，给出遍历方案，最后求出最短路径。-Ant colony algorithm for tsp (TSP) problem, given traversal solutions, and finally find the shortest path.
PathAnalysis
- vs2008下实现最短路径分析功能，直接解压运行，开发组建为AE9.3-vs2008 to achieve the shortest path analysis, direct decompression operation, the development to form the AE9.3
tu
- 图的邻接表建立以深度，广度优先及遍历，和最短路径-Adjacency table to establish the depth and breadth-first traversal, and the shortest path
zui-duan
- 最小路劲查询，源点到节点的权值与路劲走线对比选择最短路劲-Minimum Road King inquiry, the source point to the node weight compared with the Road King, choose the shortest path routing Jin
ShortestPath
- 云风的求解最短路径代码,旨在用易于理解和简洁的代码描述出 A* 算法在求最段路 * 径中的运用.-Solving the shortest path of cloud wind code, to use the code easy to understand and concise descr iption of the A* algorithm to find the section of Road* Trail of use.
k-way
- K最短路问题。大家现在已经知道了如何求单源点最短路径问题，但在实际应用中，有时候需要除了需要知道最短路径外，尚需求解次最短路或第三最短路，即要知道多条最短路，并排出其长度增加的顺序。如在通信网络中，有时候某条线路中断，则需要找一个替代的方案，这就需要找到几条最短路以备不时之需。这样一类多条最短路问题即称为K最短路问题。-K shortest path problem. We now know how to find single source shortest path problem, but
TSPantagl
- 最短路径算法，可以实现交通路径规划中的最短路径问题的求解-Shortest path algorithm, path planning can transport the shortest path to solve the problem
ACS1
- 稍加修改的基本蚁群算法，可用于求解交通路径规划中的距离最短路径的求解。-Slightly modified the basic ant colony algorithm can be used to solve the traffic path planning to solve the shortest path distance.
ACS2
- 改进的蚁群算法，用于求解基于交通密度的最短路径规划问题。-Improved ant colony algorithm for solving the shortest path based on traffic density planning.
DIJSTR
- 传统算法求解基于交通流量的最短路径问题，可以用于和群体智能算法进行比较试验。-The traditional algorithm for the shortest path based on traffic flow issues, and swarm intelligence algorithms can be used to compare the test.
Maze
- 求最短路径的程序，采用A*算法。给定一个迷宫的位图，能表示出最短路径及其长度-The shortest path of the program, using A* algorithm. Given a bitmap maze, and the length of the shortest path can be expressed
DataStruct
- 数据结构课程设计 単源最短路径实现-Curriculum design radiolabeling source data structure to achieve the shortest path
AStar
- A*（A-Star)算法是一种静态路网中求解最短路最有 A star算法在静态路网中的应用 效的方法-A* (A-Star) is a static network algorithm for solving the shortest path algorithm in most A star network of the static effective way
graph_dijkstra
- dijkstra算法，求解网络图中的最短路径问题。-dijkstra algorithm, solving the network map in the shortest path problem.
PSO-image-segmentation-algorithm
- 为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and
bellman-ford
- bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford implementation. After the shortest path to the output node of each
Dijkstra
- 设在图G={V,E}中有一顶点r，Dijkstra算法可以求出其他所有点到点r的最短路径的跳数，这是求单源最短路径的一个最基本的算法。-There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the hop count of the shortest path a