搜索资源列表
34460
- Floyd v1.0 算法执行,非常简单,由标准的C++编写。适合研究算法的人使用。-Floyd v1.0 algorithm is quite simple, standard C + +. Algorithms for the study of the population.
最短路径 迪杰斯特拉
- 最短路径 迪杰斯特拉 最短路径 迪杰斯特拉-Shortest Path Floyd Shortest Path Floyd
最短路径c++语言
- 用从c++写的floyd最短路径算法,可以求邻接矩阵任意两点的最短路径。-from using c + + to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.
数模计算工具包
- 数学建模中常用的算法,如最短路径floyd算法、蒙特卡洛仿真计算圆周率-mathematical modeling algorithm commonly used, such as the shortest path algorithm Floyd, the Monte Carlo simulation calculation of pi
最短路径的求解
- 本实验中的问题是一个逻辑问题,而实验的目的是运用邻接矩阵解决图存储并解决在此结构情况下对矩阵中元素的扫描计算。其关键是怎样储存和计算。储存用的是邻接矩阵,而计算是用迪杰斯特拉算法。-experiment of the problem is a problem of logic, and The purpose of this experiment is to use the adjacency matrix storage solutions and plans to solve the st
综合算法
- 数值类综合算法 常用数值计算工具包(龙贝格算法、改进欧拉法、龙格库塔方法、复合辛普森),Matlab数学建模工具箱(以及众多实例)。 常用算法:如Floyd算法、分治算法、动态规划、组合算法、贪婪算法-composite numerical algorithm commonly used numerical Kit (Romberg algorithm, improved Euler, Runge Kutta method composite Simpson), Matlab ma
导游图
- 用c语言实现的导游图,有图形界面,支持鼠标操作,使用dfs和floyd算法实现给出两点间最短路和最长路。-used language guides map, a graphical interface, mouse support operation, use dfs and Floyd algorithm is the shortest path between two points and the longest path.
graphic_algorithm
- 每对节点间最短路径 Floyd-Warshall 算法 D[i,j]表示从i到j的最短距离; P[i,j]表示从i到j的最短路径上j 的父节点-between each pair of nodes Shortest Path Floyd-Warshall algorithm D [i, j] said from i to j is the shortest distance; P [i, j] said from i to j the shortest path
floyd_bwj
- 准备建模时弄的 有需要的就下吧 floyd算法-ready when the need to get on the algorithm are you Floyd
zxfy_zdl
- 用Floyd算法设计的最小费用最大流,求最大流时,用的是标号算法-Floyd algorithm design with the minimum cost maximum flow, for maximum flow, the algorithm is labeling
Grraph1234
- Dijkstrat和Floyd算法实现。 算法请参考《通信网理论基础》周炯磐-Dijkstrat and Floyd algorithm. Algorithm Reference "communications network theoretical foundation", Zhou Jiong Line
jqsjxg
- VC++开发机器视觉算法源程序(全部集成在一个pdf文档里) 利用Visual C++实现AVI文件的图像截取 Visual C++中实现对图像数据的读取显示 Visual C++实现视频图像处理技术 VC编程中如何操作数据库中的图像字段 Visual C++实现数字图像增强处理 Visual C++6.0开发灰度位图处理 VC++开发腐蚀运算源程序 VC++开发膨胀运算源程序 VC++开发细化源程序 VC++开发Hough变换的源程序 VC++
jintan
- 基于Mapx开发的最短路径Floyd算法程序的实现.-Mapx development based on the shortest path algorithm procedures Floyd realized.
code
- 迪杰斯特拉算法的实现 只需要改变邻接矩阵可以直接使用 返回l和z是结果 floyd算法 同样改变邻接矩阵A,调用函数即可使用 带有数据(The implementation of the Dijkstra algorithm only needs to change the adjacency matrix and can be used directly to return to L and Z as a result The Floyd algorithm also
dist
- 用最短路径算法算出特定两点之间的距离 输入:直接读取net.in文件 第一行为四个整数N,M,S,T,每两个整数之间用一个空格隔开,分别表示网络的节点(编号为1到N),网络线段数,以及起点终点编号 接下来M行,每行三个整数U,V,D,每个整数之间用空格隔开,表示节点U和V之间有一条线路相连,距离是D,(两个节点可能有多条线路) 输出:直接写入到net.out文件,输出只有一行,表示从S点到T点的最短距离(如果不通则输出-1) (N<=100,M<=N*N,D<=100
MATLAB-floyd
- Floyd算法又称为弗洛伊德算法,插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。(The Floyd algorithm, also called the Freud algorithm and the insertion point method, is an algorithm for finding the shortest path between the vertices in a given weighted graph.)
Floyd
- 使用Floyd算法实现路径优化,找寻最短路近(The Floyd algorithm is used to optimize the path and find the shortest path near the shortest path)
pathanddistance
- 任意两点间最短路算法 Warshall-Floyd算法思想,最短距离矩阵+任意给定两顶点的最短路所包含顶点。(The shortest path algorithm between any two points The idea of Warshall-Floyd algorithm, the shortest distance matrix + the shortest path contained by any given two vertex is the vertex.)
图的最短路径之迪杰斯特拉和弗洛伊德算法
- 数据解构中的经典算法,图的最短路径算法之迪杰斯特拉和弗洛伊德的C++实现(Classic algorithms in data deconstruction, Dijkstra's and Floyd's C++ implementation of the shortest path algorithm of graphs)
图论算法及其MATLAB程序代码
- 常用图论算法及其MATLAB程序代码: 1.最短路的Warshall-Floyd算法 2.最小生成树Kruskal避圈法 3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code: 1. shortest path Warshall-Floyd algorithm 2. minimum spanning tree Kruskal avoidance meth