Image Example?Hey I was wondering If I have a graph that contains cycles. How can I break it into all possible Trees?? (Assuming the no. of vertices are very less?)
# | 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 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 154 |
7 | Dominater069 | 154 |
9 | awoo | 153 |
10 | luogu_official | 152 |
Image Example?Hey I was wondering If I have a graph that contains cycles. How can I break it into all possible Trees?? (Assuming the no. of vertices are very less?)
Name |
---|
the simplest way is probably to just try all $$$n!$$$ paths, since in the worst case, there will be about $$$n!$$$ subtrees anyways.
However, if you want it to be fast, this is what i found: http://www.hariharan-ramesh.com/papers/spantree1.pdf and https://cs.ou.edu/~thulasi/Algorithm/Complexity%20of%20Computation%20of%20a%20Spanning%20Tree%20Enumeration%20Algorithm.pdf
to convert it to the tree you need to cancel cycles: to cancel a cycle you should at least delete one edge so you should make it independently for every cycle and then combine it, I think it needs very small constraints or a small number of cycles I see an idea like this Here
Maintain a visited array and add the edges as they're given in the input. If both nodes in a given edge are visited, discard the edge.