Finding all the simple cycles in an undirected graph.

Правка en2, от Parvej, 2020-11-25 12:48:01

How can I find all the simple cycles in an undirected graph?

126615260_419079712777006_8560932289449234104_n.png In the picture, there are 3 simple cycle:

  1. 1-2-3

  2. 1-2-4-5

  3. 1-3-2-4-5

How can I print all of them?

Теги #graph, #cycles, #graph theory, #dfs and similar

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Parvej 2020-11-25 12:48:01 184
en1 Английский Parvej 2020-11-25 12:43:54 313 Initial revision (published)