[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Help - find cycles
|
From: |
Gábor Csárdi |
|
Subject: |
Re: [igraph] Help - find cycles |
|
Date: |
Fri, 17 Apr 2009 08:19:20 +0200 |
On Fri, Apr 17, 2009 at 1:29 AM, Romildo Martins
<address@hidden> wrote:
> 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?
Unfortunately I cannot really see how this could work,
Gabor
[...]
--
Gabor Csardi <address@hidden> UNIL DGM