[Top][All Lists]

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

Re: [igraph] Question on betweenness computation

From: Gabor Csardi
Subject: Re: [igraph] Question on betweenness computation
Date: Wed, 4 Jun 2008 15:07:54 +0200
User-agent: Mutt/1.5.17+20080114 (2008-01-14)


I don't think so. This is quite a special thing. It is not very hard
to modify the underlying C code to do this, but you'll have to do 
it for yourself. (Or convince us to implement it.)

In the special case when you only want to consider short paths, 
there is a betweenness.estimate function.


On Wed, Jun 04, 2008 at 02:59:52PM +0200, Rossano Gaeta wrote:
> Dear all,
> the computation of node (edge) betweenness is based on the number of 
> geodesic going through it. Is there a simple way to compute the node 
> (edge) betweenness by considering only the geodesic among a subset of the 
> graph vertices?
> Thank you in advance
> Regards
> Rossano Gaeta
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Csardi Gabor <address@hidden>    UNIL DGM

reply via email to

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