Re: [igraph] clusters(graph) with specific node

[Ragia Ibrahim]

Many thanks Gabor

---

Date: Tue, 18 Feb 2014 17:47:43 -0500
From: address@hidden
To: address@hidden
Subject: Re: [igraph] clusters(graph) with specific node

Calculate all vertices reachable from your vertex, and calculate all vertices from which your vertex is reachable, and then take their intersection. This is the strongly connected component of your vertex.

If you want to do this for all vertices, then it is better to simply calculate all strongly connected components with clusters().

G.

On Tue, Feb 18, 2014 at 5:20 PM, Ragia Ibrahim <address@hidden> wrote:

thanks T, that was helpful
BUT how to check if this reachable node belongs to SCC strongly connected component ?
thanks again
RAE

> Date: Tue, 18 Feb 2014 20:25:30 +0100
> From: address@hidden
> To: address@hidden
> Subject: Re: [igraph] clusters(graph) with specific node

>
> Hi,
>
> Take a look at ?subcomponent.
>
> --
> T.
>
>
> On Tuesday, 18 February 2014 at 20:22, Ragia Ibrahim wrote:
>
> > Hi,
> > how to create clusters(graph) that contain specific node?
> > or shall i just create all possible clusters and check it it has this node? if this is the case how to check?
> > thanks in advance
> > RAE
> > _______________________________________________
> > igraph-help mailing list
> > address@hidden (mailto:address@hidden)
> > https://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help

_______________________________________________ igraph-help mailing list address@hidden https://lists.nongnu.org/mailman/listinfo/igraph-help