文件名称:prim
介绍说明－－下载内容均来自于网络，请自行研究使用
假设G＝(V，E)是连通的，TE是G上最小生成树中边的集合。算法从U＝{u0}（u0∈V）、TE＝{}开始。重复执行下列操作：
在所有u∈U，v∈V－U的边(u，v)∈E中找一条权值最小的边(u0,v0)并入集合TE中，同时v0并入U，直到V＝U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE = {} begin. Repeat the following: In all u ∈ U, v ∈ V-U edge (u, v) ∈ E, find a minimum weight edge (u0, v0) into the collection TE, while v0 into the U, until V = U so far.
在所有u∈U，v∈V－U的边(u，v)∈E中找一条权值最小的边(u0,v0)并入集合TE中，同时v0并入U，直到V＝U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE = {} begin. Repeat the following: In all u ∈ U, v ∈ V-U edge (u, v) ∈ E, find a minimum weight edge (u0, v0) into the collection TE, while v0 into the U, until V = U so far.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
prim
....\prim.cpp