Thank you for your response. I have one more general question. I am trying to calculate the* induced subgraph of neighbors centered at a specific vertex (v).* I am using the subgraph or induced_subgraph function but I always get only one node in my subgroup.
E.g: 1. g = Graph.GRG(50, 0.2) *#number of nodes =50* 2. sub_gr=g.subgraph(5,implementation="auto")* # sub_gr is a subgraph * 3. n=a.vcount() 4. print n >>> 1 Do I do something wrong? Even if I change the value 5 in line 2, the results is 1. So every single time I get a subgraph with one node. Thank you, s 2017-02-22 10:31 GMT+01:00 Tamas Nepusz <[email protected]>: > Hello, > > I'm pretty sure that you can calculate it, but there is no built-in > function for it. You need to calculate the shortest path lengths using > igraph and then just follow the formula in the paper. > > T. > > On Wed, Feb 22, 2017 at 10:17 AM, Serafeim Loukas <[email protected]> > wrote: > >> Dear all, >> >> I would like to ask if there is a way to calculate the *Global >> Efficiency *of each node in a graph as defined by Achard 2007, Latora >> 2001). >> >> >> Thank you, >> S >> >> _______________________________________________ >> 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
