[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] How to find the disjoint cycles in a directed network
From: |
Tamás Nepusz |
Subject: |
Re: [igraph] How to find the disjoint cycles in a directed network |
Date: |
Tue, 1 Apr 2014 15:10:44 +0200 |
What do you mean by "disjoint”? Do you want to find a vertex cycle cover, an
edge cycle cover, or a cycle base? Or simply the set containing all the
possible cycles of the graph?
--
T.
------------------------------------------------------
From:address@hidden address@hidden
Reply: Help for igraph users address@hidden
Date: 1 April 2014 at 05:03:26
To: igraph-help address@hidden
Subject: [igraph] How to find the disjoint cycles in a directed network
> Hi,
>
> I want to find all the disjoint cycles in a directed network. Is there any
> command(s) to
> do this?
>
> best
> Xueming
>
>
>
>
> address@hidden
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- Re: [igraph] How to find the disjoint cycles in a directed network,
Tamás Nepusz <=