| # | 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 | 3443 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | djm03178 | 155 |
| 9 | TheScrasse | 154 |
| 10 | Dominater069 | 153 |
[Tutorial] Tree Isomorphism
I have no school right now, and there's no tutorials on Tree Isomorphism on Codeforces, so I decided to write one :).
What is a tree isomorphism?
Maybe you recognize the word isomorphic: in the context of abstract algebra when two objects are effectively the same, but are labelled differently. We can extend this to trees as well: two trees are isomorphic if they are the same, but may have different node labels. For example,
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
Olympia | 2022-03-18 19:31:26 | 5 | ||
| en6 |
|
Olympia | 2022-03-18 19:30:49 | 0 | (published) | |
| en5 |
|
Olympia | 2022-03-18 19:30:35 | 4605 | Tiny change: 'ring concactenation.' -> 'ring concatenation.' | |
| en4 |
|
Olympia | 2022-03-18 19:08:23 | 403 | ||
| en3 |
|
Olympia | 2022-03-18 19:06:12 | 1187 | Tiny change: 'rees?_\n\nNo, not in the meaningful sense. We can t' -> 'rees?_\n\nYes. We can t' | |
| en2 |
|
Olympia | 2022-03-18 18:55:22 | 731 | Tiny change: '39-AM.png)' -> '39-AM.png)\nare isomorphic because we can relabel the nodes.' | |
| en1 |
|
Olympia | 2022-03-18 17:54:29 | 495 | Initial revision (saved to drafts) |
