Location:
Search - mintreek
Search list
Description: 图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
Platform: |
Size: 1348 |
Author: lluo |
Hits:
Description: 图论中得kruskal 算法 求解最小生成树 算法为图论中得经典算法
Platform: |
Size: 1352 |
Author: 王云 |
Hits:
Description: 图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5] w (2, [3,5]) = [5,3] w (3, [4,5,6]) = [5,6,4] w (4,6) = 2 w (5,6) = 6 [a, b] = mintreek (n, w)
Platform: |
Size: 1024 |
Author: lluo |
Hits:
Description: 图论中得kruskal 算法 求解最小生成树 算法为图论中得经典算法
-In graph theory a Kruskal algorithm for minimum spanning tree algorithm in graph theory a classical algorithm
Platform: |
Size: 1024 |
Author: 王云 |
Hits:
Description: matlab 编写的 最小生成树程序代码，好东西，虽然有些简单，-the procedures of minimum spanning tree
which is compiled by matlab...
Platform: |
Size: 1024 |
Author: 武开 |
Hits:
Description: 最小生成树的Matlab程序，经典，可在6.5版图与路线-Minimum spanning tree of Matlab procedures, classic, and the route map in 6.5
Platform: |
Size: 1024 |
Author: chenjundong |
Hits:
Description: matlab经典程序 包含多个程序 值得借鉴-matlab classic several matlab classic codes
Platform: |
Size: 2087936 |
Author: zzj |
Hits:
Description: 基于matlab最小树算法
对学校和搞工程都有用-Shortest tree algorithm based on MATLAB
Platform: |
Size: 1024 |
Author: zzj |
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: Kruskal生成最小树算法，可以画出最小树-Kruskal generate a minimum spanning tree algorithm, can draw a minimum spanning tree
Platform: |
Size: 1024 |
Author: gwz |
Hits:
Description: 可以实现求最小生成树,常用于解决图论问题-It can make something true，always solve the grarf method"proplem
Platform: |
Size: 1024 |
Author: wenya |
Hits:
Description: 图论最小生成树算分，用于对线路的规划等希望对大家有用-Graph theory to the minimum spanning tree calculation points for the planning of the line, and the hope that useful
Platform: |
Size: 1024 |
Author: 许世博 |
Hits:
Description: mintreek.m
最小树枝生成发函数-the smallest branches generated hair in mintreek.m function
Platform: |
Size: 1024 |
Author: 风一 |
Hits:
Description: 程序设计的一些基本算法 及其应用 有很高的应用价值-Some basic programming algorithm and its application has a high value
Platform: |
Size: 1024 |
Author: 王刘静 |
Hits:
Description: 离散优化
*enum - 枚举法
*monte - 蒙特卡洛法
*lpint (BranchBound)- 线性整数规划
*L01p_e - 0-1整数规划枚举法
*L01p_ie - 0-1整数规划隐枚举法
*bnb18 - 非线性整数规划(在MATLAB5.3使用)
*bnbgui - 非线性整数规划图形工具(在MATLAB5.3使用)
*mintreek - 最小生成树kruskal算法
*minroute - 最短路dijkstra算法
*krusk - 最小生成树kruskal算法mex程序
*dijkstra - 最短路dijkstra算法mex程序
*dynprog - 动态规划- Discrete optimization * enum- enumeration method * monte- Monte Carlo method * lpint (BranchBound)- integer linear programming * L01p_e- 0-1 integer programming enumeration method * L01p_ie- 0-1 integer programming hidden enumeration method * bnb18- Nonlinear Integer Programming (used in MATLAB5.3) * bnbgui- nonlinear integer programming graphical tool (used in MATLAB5.3) * mintreek- kruskal minimum spanning tree algorithm * minroute- Shortest dijkstra algorithm * krusk- kruskal minimum spanning tree algorithm mex program * dijkstra- the shortest path algorithm mex program dijkstra * dynprog- Dynamic Programming
Platform: |
Size: 32768 |
Author: lxc |
Hits:
Description: % 离散优化
% *enum - 枚举法
% *monte - 蒙特卡洛法
% *lpint (BranchBound)- 线性整数规划
% *L01p_e - 0-1整数规划枚举法
% *L01p_ie - 0-1整数规划隐枚举法
% *bnb18 - 非线性整数规划(在MATLAB5.3使用)
% *bnbgui - 非线性整数规划图形工具(在MATLAB5.3使用)
% *mintreek - 最小生成树kruskal算法
% *minroute - 最短路dijkstra算法
% *krusk - 最小生成树kruskal算法mex程序
% *dijkstra - 最短路dijkstra算法mex程序
% *dynprog - 动态规划(% Discrete Optimization
% *enum - Enumeration
% *monte - Monte Carlo method
% *lpint (BranchBound) - Linear Integer Programming
% *L01p_e - 0-1 integer plan enumeration
% *L01p_ie - 0-1 Integer Programming Hidden Enumeration
% *bnb18 - Non-linear integer programming (used in MATLAB 5.3)
% *bnbgui - Non-linear integer programming graphics tool (used in MATLAB 5.3)
% *mintreek - Minimum Spanning Tree Kruskal Algorithm
% *minroute - shortest dijkstra algorithm
% *krusk - minimal spanning tree kruskal algorithm mex program
% *dijkstra - shortest dijkstra algorithm mex program
% *dynprog - Dynamic Planning)
Platform: |
Size: 34816 |
Author: valen123 |
Hits: