Location:
Search - floyd m
Search list
Description: floyd算法，matlab实现，是.m文件。简单明了
Platform: |
Size: 1098 |
Author: 小强 |
Hits:
Description: floyd算法，matlab实现，是.m文件。简单明了-floyd algorithm, matlab realize is. m file. Simple
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 采用经典的Floyd算法，计算出人员两地点间的最短路径，方便订票，很实用。且结合了MFC,界面更直观。-Floyd classic algorithm used to calculate the location of personnel between the two shortest path to facilitate the booking, it is practical. And a combination of MFC, more intuitive interface.
Platform: |
Size: 360448 |
Author: 周凯 |
Hits:
Description: floyd算法Matlab的m文件，输出任意两点间的最短路径。
Platform: |
Size: 167936 |
Author: wang |
Hits:
Description: 此算法是Floyd算法和Dijkstra算法的过程，使用matlab的M文件格式。-This algrithm is Floyd and Dijkstra.
Platform: |
Size: 3072 |
Author: 梅梅 |
Hits:
Description: 压缩包中包含5个matlab源代码和一份matlab编程指导资料。代码依次是floyd.mgrMaxFlows.m,grMinVerCover.m,mintreek.m,IntLp.m.前四个是图论与网络优化非常好用的程序，第五个用于求解整数规划问题。-Compression package contains five Matlab source code and a Matlab programming guide information. The code is followed by floyd.m grMaxFlows.m grMinVerCover.m, mintreek.m IntLp.m , the former four of graph theory and network optimization is very easy to use program, the fifth for solving integer programming problems.
Platform: |
Size: 226304 |
Author: |
Hits:
Description: 《锁相环技术》第3版，中文版，Floyd M.Garder著，经典的锁相环教材-《Phaselock Techniques》 Third Edition, by Floyd M. Gardner
Platform: |
Size: 29432832 |
Author: hou dong |
Hits:
Description: Garder 大作，通信领域同步大拿Garder的经典著作！精通锁相环！-Garder masterpiece, the communication field synchronization big take Garder classics! Proficient in phase-locked loop!
Platform: |
Size: 29840384 |
Author: 李宁 |
Hits:
Description: 简单的路径优化问题很实用的 程序代码，可以选择-For simple path optimization problem very useful program code, you can choose
Platform: |
Size: 102400 |
Author: 刘三 |
Hits:
Description: Floyd Algorithm by Visual C++
input N, M (size)
and input table
Platform: |
Size: 674816 |
Author: Phil |
Hits:
Description: 佛洛依德函数，及其求最小路径的算法。可直接使用(Floyd algorithm function)
Platform: |
Size: 1024 |
Author: KyungChulK
|
Hits:
Description: 用最短路径算法算出特定两点之间的距离
输入：直接读取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<=1000）(Use the shortest path algorithm to calculate the distance between two specific two points
Input: read the net.in file directly
The first behavior is four integers N, M, S and T. Every two integers are separated by a space, representing the node of the network (number 1 to N), the number of network segments, and the origin and destination number.
Next, M row, each row three integers U, V, D, each integer is separated by spaces, indicating that there is a line between nodes U and V, the distance is D, (there may be multiple lines in two nodes).
Output: write directly to net.out file, output only one line, which indicates the shortest distance from S point to T point (if it doesn't connect, output -1) (N<=100, M<=N*N, D<=1000).
Floyd-Warshall algorithm)
Platform: |
Size: 3334144 |
Author: kelin6 |
Hits: