Graph problem.

Правка en2, от zephyr_23, 2018-05-17 23:10:23

Given a connected, undirected graph, find maximum number of non overlapping cycles ?

Example:-

https://www.imageupload.co.uk/image/EiRJ

Here in the above example we can have 2 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)