[Networkit] Efficient way to calculate avg path length
Isra Al Qasem
isra_aq at hotmail.com
Tue Jan 27 17:20:54 CET 2015
I'm working on the most recent release of NetworKit (python package)Is APSP implemented in networkit?
> Date: Tue, 27 Jan 2015 17:05:37 +0100
> From: meyerhenke at kit.edu
> Subject: Re: [Networkit] Efficient way to calculate avg path length
> Dear Israa,
> What do you mean by efficient? Is there an algorithm that is in general
> more effiicient than APSP and averaging?
> APSP for graphs with 10M nodes can take a while, even for unweighted
> Moreover, are you looking for a C++ implementation of an avg path length
> algorithm? If not, you could put the existing pieces together in Python,
> using the cythonized C++ algorithms, of course.
> Am 25.01.15 um 16:46 schrieb Isra Al Qasem:
> > Dear NetworKit developers,
> > Is there an efficient way to estimate/calculate avg path length in a
> > graph consisting roughly of 10M nodes?
> > Thanks for your continuous help!
> Karlsruhe Institute of Technology (KIT)
> Institute of Theoretical Informatics (ITI)
> Juniorprof. Dr. Henning Meyerhenke
> Theoret. Informatics / Parallel Computing
> Phone: +49-721-608-41876
> Web: http://parco.iti.kit.edu/henningm/
> KIT - University of the State of Baden-Wuerttemberg and
> National Research Center of the Helmholtz Association
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the NetworKit