Greetings.
As we know, inside a SCT, there exists a Hamiltonian path, starting from every node.
What is an efficient way of finding a Hamiltonian path inside of a Strongly Connected Tournament?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3312 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
Finding a Hamiltonian path in a Strongly Connected Tournament
Revision en3, by Marine7, 2018-04-21 21:40:22
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Marine7 | 2018-04-21 23:57:38 | 7 | Tiny change: 'ing from every node.\n\n' -> 'ing from each node.\n\n' | |
| en3 |
|
Marine7 | 2018-04-21 21:40:22 | 7 | Tiny change: 'ing from each node.\n\n' -> 'ing from every node.\n\n' | |
| en2 |
|
Marine7 | 2018-04-21 20:43:35 | 7 | Tiny change: 'ing from every node.\n\n' -> 'ing from each node.\n\n' | |
| en1 |
|
Marine7 | 2018-04-21 13:00:20 | 260 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/26/2026 21:31:24 (g2).
Desktop version, switch to mobile version.
Supported by
