Please do read the documentation. http://igraph.org/r/doc/clusters.html
mode Character string, either "weak" or "strong". For directed graphs "weak" implies weakly, "strong" strongly connected components to search. It is ignored for undirected graphs. Gabor On Mon, Mar 17, 2014 at 12:36 PM, Ragia Ibrahim <[email protected]> wrote: > thanks T, > the graph is as follows > > > > graph <- graph( c(1,2,2,3,3,4,5,6,2,4,7,5,7,2,7,1,8,5,8,6), directed=FALSE > ) > > > and clusters(graph) > make if one SCC > shouldn't it be at least 3 SCC? > > > > > thanks for your help. > RAE > > > > > Date: Mon, 17 Mar 2014 11:54:41 +0100 > > From: [email protected] > > To: [email protected] > > Subject: Re: [igraph] SCC Tarjan's > > > > > How about using clusters() with mode="strong"? Not sure if it's Tarjan's > algorithm or some other implementation, but it does the job. > > > > -- > > T. > > > > ------------------------------------------------------ > > From: Ragia Ibrahim [email protected] > > Reply: Help for igraph users [email protected] > > Date: 17 March 2014 at 08:32:49 > > To: Help for igraph users [email protected] > > Subject: [igraph] SCC Tarjan's > > > > > Dear Group > > > > > > is Tarjan's strongly connected components, implemented in igraph ? > > > Thanks in advance > > > RAE > > > _______________________________________________ > > > igraph-help mailing list > > > [email protected] > > > https://lists.nongnu.org/mailman/listinfo/igraph-help > > > > > > > > > _______________________________________________ > > igraph-help mailing list > > [email protected] > > https://lists.nongnu.org/mailman/listinfo/igraph-help > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
