搜索资源列表
Floyd
- 最短路径的常见算法，能够算出图中所有节点之间的最短路径（时间复杂度为o(n^3)）-Common shortest path algorithm
single-gateway
- 在无线传感网络与物联网的异构融合中，通过单个网关连接是最常用的策略。本程序利用智能贪心算法寻找每个节点至网关的最短路径。-There are different approaches to integrate WSN into the Internet. The most usual one is to connect the WSN and the Internet through a gateway. This program makes uses of the greedy algorit
MST_Kruskal
- 克鲁斯卡尔算法，属于图论解决最短路径的叫优化的算法。-Kruskal algorithm, graph theory to solve the shortest path is called optimization algorithms.
Prim
- Prim算法，进行子图遍历算最短路径，现实生活中很重要的问题算法-Prim' s algorithm, the shortest path sub-graph traversal operator, in real life a very important issue algorithm
Dijkstra
- Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center la
Dijkstra
- 图与网络论中求最短路径的Dijkstra算法 M-函数 格式 [S,D]=minroute(i,m,W) i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵， 不构成边的两顶点之间的权用inf表示。显示结果为：S的每 一列从上到下记录了从始点到终点的最短路径所经顶点的序号； D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-functio
mayimatlab
- 用蚂群算法实现机器人最短路径的规划，实现语言为matlab-Ant swarm robot with the shortest path planning, implementation language for the matlab
FloydWarshall
- 这是一个最短路径的FloydWarshall算法。适合计算各个点之间的最短路径,复杂度n的三次方。 -This is a shortest path FloydWarshall algorithm. For calculating the shortest path between each point, n cubic complexity.
kspaddc
- 这是一个求解k条最短路径路由的算法程序，已经调试通过。-This is a solution of the k shortest path routing algorithm, has been through debugging.
Floydmatlab
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 通过一个图的权值矩阵求出它的每两点间的最短路径矩阵。-Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm. By weight of a graph matrix f
dijkstra
- dijkstra算法求最短路径的函数，无输入直接运行会生成一个例子供参考- DIJKSTRA Calculates the shortest distance and path between points on a map
kruskal
- 图论中用于搜索最小生成树和最短路径的Kruskal算法-Graph theory to search for the minimum spanning tree and shortest path algorithm of Kruskal
CPP_map
- 图的基本结构，及基本操作，包括最短路径树，最小生成树的Prim算法和克鲁斯卡尔算法-Map the basic structure and basic operations, including the shortest path tree, Prim' s minimum spanning tree algorithm and Kruskal algorithm
dijkstra
- dijkstra算法的最短路径MATLAB程序 能够有效搜索最短路径-dijkstra shortest path algorithm MATLAB programs can effectively search the shortest path
material
- 用C++编写最短路径的算法，以及拓扑排序算法。可以用于导航等系统。-Written in C++ shortest path algorithm, as well as topological sorting algorithm. Can be used for navigation systems.
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm.
dijkstra
- dijkstra算法，解决最短路径问题。-dijkstra algorithm to solve the shortest path problem.
simulated-annealing
- 基础的模拟退化算法，用于最短路径等优化问题-Degradation of simulation-based algorithms for optimization problems such as shortest path
Single_source_shortpath_dij
- 迪杰斯特拉算法求最短路径的并行实现，可以修改结点个数-Parallel Algorithm for Shortest Path
EfficiencyofNetworks
- 计算网络效率，输入参数，网络的邻接矩阵，输出任意节点对间的效率，及网络效率。 设计思路：floyd算法求最短路径，求倒数，求平均值-Computing network efficiency, input parameters, the network' s adjacency matrix, any node between the output efficiency, and network efficiency. Design ideas: floyd shortest path