Re: [igraph] Help - find cycles

[Romildo Martins]

Hi,

I will use minimum.spanning.tree(g) because just test with the
combination of g edges not belonging a minimum.spanning.tree. The
complexity is e(e-1) / 2.

what you think of this idea?

2009/4/16 Tamas Nepusz <address@hidden>:
>> 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
>
>