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

[Gábor Csárdi]

On Sat, Apr 11, 2009 at 6:29 PM, Romildo Martins
<address@hidden> wrote:
> Dear Gabor,
>
> To find a cicle is necessary repetead vertices, because the initial
> and final vertices are same.

Yeah, but how about the following cycle: A-B-C-D-A-E-F-G-A ?
Is this good? Every edge is used only once....

> I think in other idea, the igraph have minimum.spanning.tree(graph)
> function. Any edge added creates a cycle. And the combination of the
> added edges can also generate a new cycle.

Yeah, but if you add two edges to a tree, you can create two or three
cycles, so it is not that simple....

G.

> Just do not know how in R! : (
>
> Thanls a lot!
>
> Romildo
>
>
>
>
>
> 2009/4/11 Gábor Csárdi <address@hidden>:
>> On Sat, Apr 11, 2009 at 3:54 PM, Romildo Martins
>> <address@hidden> wrote:
>>> Dear Gabor,
>>>
>>> I think in don't repeat them on the same path, i.e, each cycle should
>>> not repeat edges found.
>>
>> Actually, not repeating _edges_ is not the same as not repeating _vertices_.
>>
>> G.
>>
>> [...]
>>
>> --
>> Gabor Csardi <address@hidden>     UNIL DGM
>>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM