[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] biconnected components

From: Gabor Csardi
Subject: Re: [igraph] biconnected components
Date: Tue, 12 Feb 2008 08:58:23 +0100
User-agent: Mutt/1.5.13 (2006-08-11)


the function is correct, at least for me and at least for this graph.
Please note that it returns not _vertices_ but _edges_, every biconnected
component is given by a list of edges which constitute its spanning

I know this is strange, sorry for that. The idea behind it was that
the memory requirements can be much bigger if one returns lists
of vertices, as calculating the biconnected components is basically a
partitioning of the edges, but not the vertices. The R manual page
contains an example on how to convert the list of edges to a list
of vertices. It is not hard, you just go over all the edges 
and collect their end points; the only difficulty is that you'll find
a vertex many times.


On Mon, Feb 11, 2008 at 06:43:13PM -0800, Anirban Dasgupta wrote:
> Hi,
>    I am a new user of igraph, which seems like a fantastic package. I
> have a question about the function "igraph_biconnected_components"  in
> the 0.4.5 version. When run on the simple three node graph, the
> undirected triangle, the resulting biconnected component comes out to
> be only two nodes. In general, I think, the articulation points are
> not being added to the corresponding components. Can anyone confirm
> this ? Does anyone already have a fix?
> thanks and regards
> -anirban
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Csardi Gabor <address@hidden>    UNIL DGM

reply via email to

[Prev in Thread] Current Thread [Next in Thread]