I'm searching for solution of euclidean minimum spanning tree if solution has create add-on-nodes between given data points which e.g. https://en.wikipedia.org/wiki/Euclidean_minimum_spanning_tree doesn't mention. these add-on-nodes would connect three edges at angles of 120 degres...
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | atcoder_official | 162 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
→ Find user
→ Recent actions
? Euclidean minimum spanning tree
Difference between ru1 and en1,
changed 318 character(s)
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
beatoriche | 2019-04-14 12:39:08 | 318 | Initial revision for English translation | |
| ru1 |
|
beatoriche | 2019-04-14 12:38:50 | 318 | Первая редакция (опубликовано) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/19/2024 04:26:38 (h1).
Desktop version, switch to mobile version.
Supported by
