Poj 3552 Slim Span 最小生成树
摘要:
-----------------Slim SpanTime Limit:5000MSMemory Limit:65536KTotal Submissions:5725Accepted:3008DescriptionGiven an undirected weighted graphG, you should find one of spanning trees specified as follows.The graphGis an ordered pair (V,E), whereVis a set of vertices {v1,v2, …,vn} andEis a set of und 阅读全文
posted @ 2013-09-25 21:13 电子幼体 阅读(153) 评论(0) 推荐(0) 编辑