生成树
ujn20161222
persistence
展开
-
Constructing Roads_最小生成树_2018_3_3
There 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 ...原创 2018-03-03 22:16:36 · 113 阅读 · 0 评论 -
Agri-Net _最小生成树_2018_3_4
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer John...原创 2018-03-04 14:21:02 · 162 阅读 · 0 评论 -
Slim Span _枚举_生成树_2018_3_4
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 set of vertices {v1, v2, …, vn}...原创 2018-03-04 22:17:33 · 133 阅读 · 0 评论 -
The Unique MST_生成树2018_3_5
Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of...原创 2018-03-05 20:32:08 · 194 阅读 · 0 评论 -
Highways_生成树2018_3_5
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem...原创 2018-03-05 20:48:44 · 107 阅读 · 0 评论