- Category:
- matlab
- Tags:
-
[Matlab]
[源码]
- File Size:
- 1kb
- Update:
- 2013-08-24
- Downloads:
- 0 Times
- Uploaded by:
- 刘适
Description: Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.
To Search:
File list (Check if you may need any files):
tree_kruskal最小生成树.m
Download