Re: [igraph] Find circuits(cycles) in graph

[Gábor Csárdi]

It is certainly possible to do it, whether by changing girth or some
other way is a different question.

It is important to realize that you need to make some constraint on
the cycles, because otherwise there may be an infinite number of them.
E.g. the algorithm should ignore all cycles that contain another cycle
more than once, at the very least.

Gabor

On Fri, Apr 10, 2009 at 4:25 PM, Romildo Martins
<address@hidden> wrote:
> Dear Gábor Csárdi,
>
> exists the possibility of developed this function? Because the girtt
> function analyse all circuits!
>
> Thaks a lot,
>
> Romildo
>
> 2009/4/10 Gábor Csárdi <address@hidden>:
>> Hi, there is no such function, as far as I know.
>>
>> Gabor
>>
>> On Fri, Apr 10, 2009 at 3:27 PM, Romildo Martins
>> <address@hidden> wrote:
>>> Hi,
>>>
>>> I would like to know if there is any function that returns all
>>> circuits(cyles) in a graph.
>>> The girth function finds only the minimum circuit in a graph.
>>>
>>> Thanks a lot,
>>>
>>> Romildo
>>>
>>>
>>> _______________________________________________
>>> igraph-help mailing list
>>> address@hidden
>>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>>>
>>
>>
>>
>> --
>> Gabor Csardi <address@hidden>     UNIL DGM
>>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM