Kruskal算法解決POJ 2421－－有點難度
摘要：
DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road bet 閱讀全文
posted @ 2011-09-22 19:10 More study needed. 閱讀(482) 評論(0) 推薦(0)
浙公網安備 33010602011771號