摘要: For a given weighted graph G=(V,E), find the minimum spanning tree (MST) of G and print total weight of edges belong to the MST. Input In the first li 阅读全文
posted @ 2020-12-02 19:53 BlackSnow 阅读(129) 评论(0) 推荐(0)