toolkit for the analysis of large (not necessarily complex) networks. A
frontend in Python and a backend in C++ with OpenMP parallelism combine
the best of both worlds. NetworKit allows exploratory workflows with the
execution speed of natively compiled (and often parallel) code.
Major changes include the addition of new dynamic centrality algorithms
and a faster algorithm for listing all maximal cliques. Many changes
under the hood should also make the work with NetworKit even more enjoyable.
More information can be found at http://network-analysis.info. Feedback
is appreciated and best submitted on the mailing list (link available
from the main website).
Best regards,
NetworKit Team
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
