Exploring network structure, dynamics, and function using NetworkX
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Colgate University, Hamilton, NY (United States)
NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 960616
- Report Number(s):
- LA-UR-08-05495; LA-UR-08-5495; TRN: US201006%%1254
- Resource Relation:
- Conference: SCIPY 08 ; August 21, 2008 ; Pasadena, Pasadena, CA (United States), 21 Aug 2008
- Country of Publication:
- United States
- Language:
- English
Similar Records
Algebraic Algorithms for Betweenness and Percolation Centrality
Parallel processing of filtered queries in attributed semantic graphs