2019年8月10日
K - The Unique MST (最小生成树的唯一性)
摘要： Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph 阅读全文
posted @ 2019-08-10 20:27 cherish__lin 阅读(671) 评论(0) 推荐(0) 编辑