NetworKit is maintained by the research group Exascale Algorithm Engineering of the Scientific Computing Center at the Karlsruhe Institute of Technology (KIT). Until 2025, the Research Group Modeling and Analysis of Complex Systems of the Institute of Computer Science at the Humboldt-University of Berlin maintained NetworKit. NetworKit was seeded by the project Parallel analysis of dynamic networks – Algorithm engineering of efficient combinatorial and numerical methods, for which we acknowledge financial support by MWK Baden-Württemberg. In this project Henning Meyerhenke was the principal investigator and Christian L. Staudt was the main PhD student. Since NetworKit’s start in 2013, it has grown well beyond the original MWK project and our group, with contributors and users from all over the world.
Eugenio Angriman
Fabian Brandt-Tumescheit
Mikhail Kirilin
Henning Meyerhenke
Andreas Scharf
Elisabetta Bergamini
Kolja Esders
Alexander van der Grinten
Christian L. Staudt
Maximilian Vogel
Klaus Ahrens
Thijs Baaijen
Roman Bange
Jason Barnett
Lukas Barth
Miriam Beddig
Lukas Berner
Stefan Bertsch
Pratistha Bhattarai
Andreas Bilke
Simon Bischof
Guido Brückner
Jonas Charfreitag
Hanzhi Chen
Daniel Darabos
Quan Do
Stephan Druskat
Mark Erb
Roman Erhardt
Philipp Fischbeck
Patrick Flick
John Gelhausen
Frieda Gerharz
Ilan Gold
Lars Gottesbüren
Jeff Green
David Grinberg
Michael Hamann
Lukas Hartmann
Ali Haydari
Till Hoffmann
Daniel Hoske
Tony Jin
Rasmus Joergensen
Yani Kolev
Alexander Leonhardt
Marten Lienen
Gerd Lindner
Moritz v. Looz
Sarah Lutteropp
Yassine Marrakchi
Franz-Benjamin Mocnik
Ramlah Munir
Charmaine Nyambura Ndolo
Marc Nemes
Nguyen
Chien-Chun Ni
Mustafa Özdayi
Manuel Penschuck
Lucas Archimedes Gregorio Henr Petersen
Angus Petholz
Marvin Pogoda
Jure Pustoslemšek
Marcel Radermacher
Klara Reichard
Matteo Riondato
Marvin Ritter
Daeho Ro
Aleksejs Sazonovs
Dominik Schweisgut
Arun Sharma
Arie Slobbe
Anton Soloviev
Jonas Spinner
Jonathan Striebel
Hung Tran
Florian Weber
Deklan Webster
Michael Wegner
Jörg Weisbarth
David Weiss
Florian Willich
Shangdi Yu
Siyan Zhao
The source code of this program is released under the MIT License. We ask you to cite us if you use this code in your project (c.f. our publications and especially the technical report). Feedback is also welcome.
The program source includes:
the tlx collection of C++ data structures, algorithms and helpers by Timo Bingmann and contributors
the TTMath bignum library by Tomasz Sowa
the Dynamic Hashed Blocks (DHB) data structure for dynamic graphs by Alexander van der Grinten, Maria Predari and Florian Willich
the GoogleTest framework, which runs our unit tests
Data sets that are often used for benchmarking algorithms in NetworKit are listed on our data sets page.