UVA - 1395 Slim Span Kruskal算法变形
Slim Span
Description
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, …, ...
原创
2018-11-07 21:35:20 ·
205 阅读 ·
0 评论