Given a connected, undirected graph, find maximum number of non overlapping cycles ?
Example:-
Here in the above example we can have 2 (maximum number) non overlapping cycles, 0-1-2 and 4-5-6.
№ | Пользователь | Рейтинг |
---|---|---|
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 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Graph problem.
Given a connected, undirected graph, find maximum number of non overlapping cycles ?
Example:-
Here in the above example we can have 2 (maximum number) non overlapping cycles, 0-1-2 and 4-5-6.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en5 | zephyr_23 | 2018-05-18 09:01:02 | 55 | Tiny change: 'd 4-5-6.\n' -> 'd 4-5-6.\n\nAny idea of how to solve this problem efficiently ?\n' | ||
en4 | zephyr_23 | 2018-05-17 23:11:24 | 17 | Tiny change: 'an have 2 non overl' -> 'an have 2 (maximum number) non overl' | ||
en3 | zephyr_23 | 2018-05-17 23:10:48 | 48 | |||
en2 | zephyr_23 | 2018-05-17 23:10:23 | 87 | |||
en1 | zephyr_23 | 2018-05-17 23:09:00 | 266 | Initial revision (published) |
Название |
---|