搜索资源列表
CPP_map
- 图的基本结构，及基本操作，包括最短路径树，最小生成树的Prim算法和克鲁斯卡尔算法-Map the basic structure and basic operations, including the shortest path tree, Prim' s minimum spanning tree algorithm and Kruskal algorithm
material
- 用C++编写最短路径的算法，以及拓扑排序算法。可以用于导航等系统。-Written in C++ shortest path algorithm, as well as topological sorting algorithm. Can be used for navigation systems.
dijkstra
- dijkstra算法，解决最短路径问题。-dijkstra algorithm to solve the shortest path problem.
Single_source_shortpath_dij
- 迪杰斯特拉算法求最短路径的并行实现，可以修改结点个数-Parallel Algorithm for Shortest Path
sdsff
- 最短路径的一些算法总结，自己曾经编写的 希望对大家有用-Summary of some of the shortest path algorithm, what they have written I hope useful
shortest-path-algorithm-
- 有多个经度纬度已知的地点，用退火算法求最短路径。求一个从点1 出发，走遍所有中间点，到达点102 的一个最短路径。-There are several known longitude-latitude locations, the shortest path algorithm with annealing. Seeking a departure from the point 1, traveled all the intermediate points, to reach a 102-poi
lala
- 用遗传算法求解最短路径问题求解的遗传算法的参数设定如下： 种群大小：M = 50 最大代数：G = 1000 交叉率： = 1 c p ，交叉概率为1 能保证种群的充分进化。 变异率： = 0.1 m p ， 一般而言，变异发生的可能性较小-With a genetic algorithm to solve the shortest path problem of the genetic algorithm parameter settings are as follows: p
length
- 利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度-average path lengh
shortest_path
- 求取给定图的多元最短路径，使用FLOYD算法实现，简单明了，注释详细！-Strike a given graph of multiple shortest path algorithm using FLOYD, simple and clear, detailed notes!
Floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm.
Prime
- prime算法实现，求图的最短路径，算法课的作业-prime algorithm, find the map of the shortest path algorithm homework assignment
Shortest-path
- 因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables
shortest
- 最小代价生成树，克鲁斯卡尔算法，最短路径-Minimum cost spanning tree, Kruskal algorithm
dijkstra
- 图论中求最短路径的dijkstra算法，自己写的，-Graph theory ； shortest path ；dijkstra algorithm
Dijkstra
- 用c++实现最有向连同图的短路径算法。图的路径带有权值。-With c++, together with plans to achieve the most short-path algorithm. That path with the right values.
Lying-data-structure9
- 《大话数据结构》主要内容包含：数据结构介绍、算法推导大O阶的方法；顺序结构与链式结构差异、栈与队列的应用；串的朴素模式匹配、KMP模式匹配算法；二叉树前中后序遍历、赫夫曼树及应用；图的深度、广度遍历；最小生成树两种算法、最短路径两种算法；拓扑排序与关键路径算法；折半查找、插值查找、斐波那契查找等静态查找；稠密索引、分块索引、倒排索引等索引技术；冒泡、选择、插入等简单排序；希尔、堆、归并、快速等改进排序-" Westward the data structure," the m
DIJKSTRA
- 迪杰斯特拉 算法 求最短路径，我用VC 做的，很不错。供大家阅读。-Dijkstra shortest path algorithm, I use VC to do, very good. For all to read.
graph_search.docx
- python 图的搜索树算法实现 最短路径-python graph search tree algorithm
dj
- Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径-Dijkstra (Dijkstra) algorithm is a typical shortest path routing algorithm used to calculate a node to all other nodes of the shortest path
Network-node-shortest-path
- 此代码实现了网络结点之中最短路径的计算，并输出了各个网络结点的路由表 ，路由表包括：目的网络，下一跳，代价，详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routi