On Tue, Nov 26, 2013 at 9:12 AM, Matthew Galati <[email protected]> wrote: > >> I guess you are right. I just took the formula from Freeman's classic >> paper, and never realized that it only works for undirected graphs, >> for directed graphs you need to halve that, because there are twice as >> many shortest paths, right? > > > Yes. I think the normalization should be 1/((n-1)(n-2)). And, for > undirected, if you double count (which you probably do), then you need the > 2.
It's not because of the double-counting, it's because for undirected you divide by (n-1)(n-2)/2. Anyway, I'll fix this ASAP. G. > _______________________________________________ > 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
