Why cycle detection algorithm differs in directed and undirected graphs?

Правка en2, от old._.monk, 2021-06-03 12:08:56

I'm not able to grasp why the algorithms for cycle detection differ when graphs are directed or undirected.

I found the two algorithms here cp algorithms link

Found an explanation on stackoverflow, but it's still unclear.

Is there any counter-example?

Теги #graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский old._.monk 2021-06-03 12:08:56 8
en1 Английский old._.monk 2021-06-03 10:26:54 506 Initial revision (published)