[Top][All Lists]

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

Re: [igraph] How to find cut points and bridges?

From: Tamás Nepusz
Subject: Re: [igraph] How to find cut points and bridges?
Date: Thu, 8 Sep 2011 21:03:16 +0200


Cut points are called "articulation points" in igraph, so try this:


Bridges are not implemented in igraph, but you can try to implement Tarjan's 
algorithm (see http://en.wikipedia.org/wiki/Bridge_(graph_theory) ). The first 
step of that algorithm involves finding a spanning tree, for which there is 
already a function in igraph. The remaining three steps have to be coded by 


On 8 Sep 2011, at 19:02, Carlos Eduardo wrote:

> Hi,
> I just begun my learning about how to use igraph package.
> In the documentation http://igraph.sourceforge.net/doc/R/00Index.html I 
> couldn’t find commands to find out the network cut points (vertex) and 
> bridges (edges). Do you know any command in igraph to do it?
> Thanks in advance,
> Cadu
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

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