搜索资源列表
XShortest
- 最短路径的并行算法 采用TBB 需要intel编译器 速度很快-Parallel shortest path algorithm required the use of TBB fast intel compiler
ksp
- 求前k条最短路径,本程序可用于求地图的路线安排和前k个最短路径分配问题，十分管用，可用于2000个点的计算-find out the kth shortest path
guangdusousuo
- 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, th
Algorithms_for_Graph_theory
- C++图论算法，dijistra shortest path， floyd shortest path等最短路算法-Graph Theory algorithms, dijistra shortest path， floyd shortest path，
Dijkstra-omp
- C语言和OpenMP编写的可在多核或SMP处理器上进行多线程运行的最短路径算法。可了解多核多线程和OpenMP的并行编程技术。-C language and can be prepared OpenMP or multi-core processors on SMP multi-threading to run the shortest path algorithm. Learn to multi-core multi-thread a
ShortestPath_Djk-complexnetworks
- 复杂网络最短路径算法，详细而有条理，很有帮助-Complex network shortest path algorithm, detailed and structured, very helpful
ssd5_exam3
- Class Shortest models a shortest path calculation between two registered users.
FindShortPath
- arcgis+C#组件 写的 实现 最短路径分析-arcgis+ C# component to write to achieve the shortest path analysis
Dijkstra
- Sample program in Java applet demonstarting Dikjstras Algorith(Shortest Path Algorithm).
K
- K 最短路径 K 最短路径 代码 -improved routing algorithm used to find from source to destination node of the first k Shortest Path
yiqun
- 蚁群算法，基于蚁群算法的最短路径问题，编译环境为c-Ant algorithm, ant colony algorithm based on the shortest path problem, the compiler environment for c++
SSP
- I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and m
dijkstra
- tentang shortest path
routing
- this use the matlab...routing protocol shortest path algorithm-this is use the matlab...routing protocol shortest path algorithm
ALG_K_ShortPath
- this a program to count the shortest path in a graph-this is a program to count the shortest path in a graph
ycsf_zdlj
- 基于遗传算法的最短路径计算 程序简洁 速度很快 界面不是很完善-Based on genetic algorithms calculate the shortest path
JAVA
- 在城市智能交通中,经常会用到最短路径的问题,比如找最佳的行车路线等,Dijkstra算法做为最经典的求解方法,为我们指明了方向.不过真正想让我了解该算法的原因是在学习ICTCLAS的N-最短路径算法。-Intelligent Transportation in the city, often used the issue of the shortest path, for example, to find the best travel
Shortest_path_counting
- acm算法设计： 描述： 国际象棋车可以水平或垂直的任何方在同一行或同一列的棋盘。 找到一些最短路径的一个车可以从一个角落里一个棋盘的斜对面角落。 输入： 一整数n为行数和列的棋盘。0 < n <=16 输出： 数量的最短路径。 例输入： 3或4 例输出： 6或20 -Descr iption： A chess rook can move horizontally or
tsp
- 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
aa
- 蚁群算法 适合寻找最优问题，实现最短路径。-Ant colony algorithm for finding the optimal problem, the realization of the shortest path.