2018年3月1日
最小生成树 + 枚举最小边
摘要： Given an undirected weighted graph G, you should find one of spanning trees specified as follows. The graph G is an ordered pair (V, E), where V is a 阅读全文
posted @ 2018-03-01 15:14 楼主好菜啊 阅读(207) 评论(0) 推荐(0) 编辑