NetworkX
| Developer(s) | LANL and others |
|---|---|
| Stable release | 1.10 / August 2, 2015 |
| Written in | Python |
| Operating system | Cross-platform |
| Type | Software library |
| License | BSD-new license |
| Website |
networkx |
NetworkX is a Python library for studying graphs and networks. NetworkX is free software released under the BSD-new license.
Features
A graph created with NetworkX
- 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.
Suitability
NetworkX is suitable for operation on large real-world graphs: e.g., graphs in excess of 10 million nodes and 100 million edges.[1] 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.[2]
Integration
NetworkX is integrated into Sage.[3]
See also
References
- ↑ A Hagberg, D Conway, "Hacking social networks using the Python programming language (Module II - Why do SNA in NetworkX)", Sunbelt 2010: International Network for Social Network Analysis.
- ↑ A Hagberg, D Schult, P 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.
- ↑ http://sagemath.org/links-components.html
External links
- Official website
- NetworkX discussion group
- Survey of existing graph theory software
- Main Github repository
| ||||||||||
This article is issued from Wikipedia - version of the Sunday, April 03, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.