[Networkit] Efficient way to calculate avg path length

Henning Meyerhenke meyerhenke at kit.edu
Tue Jan 27 17:05:37 CET 2015


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 
graphs...

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.

Best,
Henning


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 --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 5316 bytes
Desc: S/MIME Cryptographic Signature
URL: <https://lists.ira.uni-karlsruhe.de/mailman/private/networkit/attachments/20150127/52ecc09b/attachment.p7s>


More information about the NetworKit mailing list