This article may rely excessively on sources too closely associated with the subject, potentially preventing the article from being verifiable and neutral. (January 2021) (Learn how and when to remove this template message)
A graph created with NetworkX
|Original author(s)||Aric Hagberg|
|Initial release||11 April 2005|
2.5 / 22 August 2020
- Classes for graphs and digraphs.
- Conversion of graphs to and from several formats.
- Ability to construct random graphs or construct them incrementally.
- Ability to find subgraphs, cliques, k-cores.
- Explore adjacency, degree, diameter, radius, center, betweenness, etc.
- Draw networks in 2D and 3D.
NetworkX is suitable for operation on large real-world graphs: e.g., graphs in excess of 10 million nodes and 100 million edges.[clarification needed] Due to its dependence on a pure-Python "dictionary of dictionary" data structure, NetworkX is a reasonably efficient, very scalable, highly portable framework for network and social network analysis.
- NetworkX first public release (NX-0.2), From: Aric Hagberg, Date: 12 April 2005, Python-announce-list mailing list
- NetworkX initial release, NX-0.2, hagberg – 2005-04-11, Project Info – NetworkX, Registered: 2004-10-21, SourceForge.net
- Aric Hagberg, Drew Conway, "Hacking social networks using the Python programming language (Module II – Why do SNA in NetworkX)", Sunbelt 2010: International Network for Social Network Analysis.
- Aric A. Hagberg, Daniel A. Schult, Pieter J. Swart, Exploring Network Structure, Dynamics, and Function using NetworkX, Proceedings of the 7th Python in Science conference (SciPy 2008), G. Varoquaux, T. Vaught, J. Millman (Eds.), pp. 11–15.