**********theleastflightpathstheleastcostFlightPathProblemMinimumSpanningTreeMinimumSpanningTreeIntroductionProblemDefinitionBoruvka'',simple,,mthenumberofedgesinagraphG=(V,E).Ourgraphsareweighted,w(e);everyspanningtreehasexactlyn-(MST):TheMinimalSpanningTreeproblem(MSTP)is:Input:AweightedgraphG=(v,e,w).Output:,aspanningtreedoesnotexistandwegeneralizethenotionofaminimumspanningtreetothatofaminimumspanningforest(MSF).:Asetoftrees,ponentofG,.
MST-最小生成树 PPT课件 来自淘豆网m.daumloan.com转载请标明出处.