文件名称:Prims_Algorithm
介绍说明－－下载内容均来自于网络，请自行研究使用
Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Prims Algorithm
...............\MiniSpenTree.m
...............\Result.txt
...............\testfile1.txt
...............\MiniSpenTree.m
...............\Result.txt
...............\testfile1.txt