小生成树定义与贪心算法.pdfVIP

§5MinimumSpanningTree

【Definition】AspanningtreeofagraphGisatreewhich

consistsofV(G)andasubsetofE(G)

〖Example〗Acompletegraphandthreeofitsspanningtrees

Note:Note:

TheminimumspanningtreeisaTheminimumspanningtreeisatreetreesinceitisacyclic--sinceitisacyclic--thethe

numberofedgesis|V|–numberofedgesis|V|–1.1.

ItisItisminimumminimumforthetotalcostofedgesisminimized.forthetotalcostofedgesisminimized.

ItisItisspanningspanningbecauseitcoverseveryvertex.becauseitcoverseveryvertex.

AminimumspanningtreeexistsiffGisAminimumspanningtreeexistsiffGisconnectedconnected..

Addinganon-treeedgetoaspanningtree,weobtainaAddinganon-treeedgetoaspanningtree,weobtainacyclecycle..

1/9

§5MinimumSpanningTree

GreedyMethodMakethebestdecisionforeachstage,underthe

followingconstrains:

(1)wemustuseonlyedgeswithinthegraph;

(2)wemustuseexactly|V|−1edges;

(3)wemaynotuseedgesthatwouldproduceacycle.

1.Prim’sAlgorithm–growatree

/*verysimilartoDijkstra’salgorithm*/

2

§5MinimumSpanningTree

GreedyMethodMakethebestdecisionforeachstage,underthe

followingconstrains:

(1)wemustuseonlyedgeswithinthegraph;

(2)wemustuseexactly|V|−1edges;

(3)wemaynotuseedgesthatwouldproduceacycle.

1.Prim’sAlgorithm–growatree

/*verysimilartoDijkstra’salgorithm*/

2

§5MinimumSpanningTree