搜索资源列表
FW
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
Floyd-Warshall
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted graph. The algorithm name to one of the founders,
Shortest-path
- 数据结构 基于邻接表的有向图最短路径快速算法-Data structure Quickly to the shortest path algorithm based on adjacency list
Freud-was-proposed
- 用来求图中的最短路径的一个方法：弗洛依德算法。-A method used the figure, find the shortest path: Floyd algorithm.
Dijkstra-algorithm
- 这是求图中的最短路径的一个方法：迪杰斯特拉算法。-This is a method of the figure, find the shortest path: Dijkstra algorithm.
dijstla
- 用邻接表实现的迪杰斯特拉最短路径的算法描述-Adjacency list Dijkstra shortest path algorithm descr iption
sp
- 狄克斯特拉算法：求一点到其余点的最短路径-the Dijkstra for short path
DG-shortest-path
- 有向图最短路径的查找与展示代码，通过Dijkstra算法实现。-The code of the retrieval and the show of the directed graph. It uses the Dijstra s algorithm to complete.
The-SP-of-WH-Univers
- 利用BellmanFord算法计算武汉各高校之间最短路径。-The shortest path algorithm of Wuhan Universities based on BellmanFord
shortest_path_floyd
- 数据结构中弗洛伊德算法的源代码，用于求最短路径。-Floyd algorithm data structure of the source code for the shortest path.
Plumbing-problems
- 数据结构中的管道铺设问题，考虑成本选择最短路径，是关于图，利用迪杰斯特拉算法的一个数据结构经典问题。-Plumbing problems in data structure.
Dijkstra
- 有向图某顶点到其他顶点最短路径的C程序实现代码(Dijkstra算法) -Digraph a vertex to another vertex shortest path C program code (Dijkstra algorithm)
ten-algorithm
- 目录 1，搜索算法； 2，贪心算法； 3，动态规划； 4，最短路径； 5，最小生成树； 6，二分图的最大匹配； 7，-Contents 1, the search algorithm 2, the greedy algorithm 3, dynamic programming 4, the shortest path 5, the minimum spanning tree 6, maximum bipartite matching 7, ...
Dijkstra
- Dijkstra算法，求任意两个点的最短路径的经典算法-Dijkstra algorithm
shortroute
- 一个求最短路径的程序，使用了广度优先搜索，深度优先搜索和帝斯卡尔算法来求出一张图的最短路，是一个范例程序-A shortest path, the use of a breadth-first search, depth-first search algorithm to find a Dili Scalzi shortest figure is a sample program
Dijkstra
- 用D[i]来表示当前从源到顶点i的最短特殊路径长度。假设u是G的某一顶点，把从源到u且中间只经过S中顶点的录称为从源到u的特殊路径，并用D数组记录当前每个顶点对应的最短特殊路径长度。Dijkstra算法每次从V-S中取出具有最短特殊路径长度的顶点u,将u添加到S中，同时对D数组作必要的修改。一旦S中包含了V中所有顶点，D就记录了从源到所有其它顶点之间的最短路径长度。-With D [i] to indicate the current node i from the source to the
FreeTree
- 无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径-Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T
Bellman_ford
- T004_最短路径Bellman_ford算法-T004_ Bellman_ford shortest path algorithm
Bellman_ford
- T0041_最短路径Bellman_ford算法优化,bellman-ford优化-T0041_ Bellman_ford shortest path algorithm optimization, bellman-ford optimization
T006_Floyd_Warshal
- T006_Floyd_Warshall算法任意两点间的最短路径-T006_Floyd_Warshall algorithm shortest path between any two