Hello everyone. The question goes as follows : Given an unweighted undirected graph we need to construct the tree with minimum depth such that the tree consists of all the vertices of the graph. Can you please help me with a solution?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Romok007 | 2019-06-25 18:32:34 | 10 | Tiny change: 'ndirected grap' -> 'ndirected connected grap' | |
| en3 |
|
Romok007 | 2019-06-25 15:55:07 | 60 | ||
| en2 |
|
Romok007 | 2019-06-25 12:29:49 | 4 | Tiny change: 's follows given an un' -> 's follows : Given an un' | |
| en1 |
|
Romok007 | 2019-06-25 12:29:28 | 269 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 15:48:55 (k1).
Desktop version, switch to mobile version.
Supported by
