Re: [igraph] Help - find cycles

[Tamas Nepusz]

> a Hamiltonian cycle of the graph. So you might as well just use a
> subgraph isomorphism algorithm to detect all cycles of a given length.
Note that this returns all cycles of length k k*2 times - starting  
from each vertex of the cycle in both traversal directions.

--
Tamas