NetworkX

NetworkX
NetworkX
Developer(s) LANL and others
Stable release 1.6 / November 22, 2011; 0 days ago (2011-11-22)
Written in Python
Operating system Cross-platform
Type Software library
License BSD-new license
Website http://networkx.lanl.gov/

NetworkX is a Python library for studying graphs and networks. NetworkX is free software released under the BSD-new license.

Contents

Features

  • 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 these projects:

References

  1. ^ 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.
  2. ^ 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.
  3. ^ http://sagemath.org/links-components.html

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Floyd–Warshall algorithm — In computer science, the Floyd–Warshall algorithm (sometimes known as the WFI Algorithm or Roy–Floyd algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed… …   Wikipedia

  • Web browser — Internet Explorer, one of the most widely used web browsers[1] …   Wikipedia

  • Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia

  • Network theory — For network theory of the regulation of the adaptive immune system see Immune network theory For the sociological theory, see Social network Network theory is an area of computer science and network science and part of graph theory. It has… …   Wikipedia

  • Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network …   Wikipedia

  • List of companies of Nigeria — This is a list of Nigerian companies. The companies are currently listed by sector. The list is incomplete.Quasi governmental corporations* Central Bank of Nigeria * Federal Department of Antiquities * National Commission for Museum Monuments *… …   Wikipedia

  • Community structure — In the study of complex networks, a network is said to have community structure if the nodes of the network can be easily grouped into (potentially overlapping) sets of nodes such that each set of nodes is densely connected internally. In the… …   Wikipedia

  • Sage (Computeralgebrasystem) — Sage Aktuelle Version 4.7.1 (11. August 2011) Betriebssystem Linux, Unix Programmier­sprache Python, Cython, C, C++, Fortran …   Deutsch Wikipedia

  • SAGE — Saltar a navegación, búsqueda Para otros usos de este término, véase Sage (desambiguación). SAGE El interface gráfico bajo Firefox …   Wikipedia Español

  • Sage — У этого термина существуют и другие значения, см. Sage (значения). Sage …   Википедия

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”