I've heard of this technique many times but haven't found any suitable tutorial on it. I'll be glad if someone explains it, how it works, where it can be used, sample code of it or some sample problems.
Thanks in advance.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
I've heard of this technique many times but haven't found any suitable tutorial on it. I'll be glad if someone explains it, how it works, where it can be used, sample code of it or some sample problems.
Thanks in advance.
Name |
---|
What ordering are you searching for exactly? There are quite a few -> topological sort, perfect elimination order, etc. order can give you the info about the position (rotations) of neighbours if it describes a graph on a plane. Unless "vertex ordering" is a name of some algorithm, i think people need some more info to help you ;)
This one may help you.
Problem Link : http://mirror.codeforces.com/contest/161/problem/D
Solution Link : http://paste.ubuntu.com/5710587/