You are given an undirected unweighted connected graph consisting of n vertices
and m edges. It is guaranteed that there are no self-loops or multiple edges in
the given graph.
Your task is to find any spanning tree of this graph such that the degree of the
first vertex (vertex with label 1 on it) is equal to D (or say that there are no
such spanning trees). Recall that the degree of a vertex is the number of edges
incident to it.
【Input】
The first line contains three integers n, m and D (2≤n≤2⋅105, n−1≤m≤min(2⋅105,n
(n−1)2),1≤D<n) — the number of vertices, the number of edges and required degree
of the first vertex, respectively.
The following m lines denote edges: edge i is represented by a pair of integers
vi, ui (1≤vi,ui≤n, ui≠vi), which are the indices of vertices connected by the
edge. There are no loops or multiple edges in the given graph, i. e.for each
pair (vi,ui) there are no other pairs (vi,ui)or(ui,vi) in the list of edges,andfor each pair (vi,ui) the condition vi≠ui is satisfied.
【Output】
If there is no spanning tree satisfying the condition from the problem statement,
print "NO" in the first line.
Otherwise print "YES" in the first line and then print n−1 lines describing the
edges of a spanning tree such that the degree of the first vertex (vertex with
label 1 on it) is equal to D. Make sure that the edges of the printed spanning
tree form some subset of the input edges (order doesn't matter and edge (v,u) is
considered the same as the edge (u,v)).
If there are multiple possible answers, print any of them.
Codeforces Round #544 (Div. 3)-F2. Spanning Tree with One Fixed Degree-求无向图中满足1号节点的度为d的生成树
Codeforces Round #544 (Div. 3)-F2. Spanning Tree with One Fixed Degree-求无向图中满足1号节点的度为d的生成树【Description】You are given an undirected unweighted connected graph consisting of n vertices and m edges. I...