NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.
- Mailing List
A quick example that finds the shortest path between two nodes in an undirected graph:
>>> import networkx as nx >>> G = nx.Graph() >>> G.add_edge('A', 'B', weight=4) >>> G.add_edge('B', 'D', weight=2) >>> G.add_edge('A', 'C', weight=3) >>> G.add_edge('C', 'D', weight=4) >>> nx.shortest_path(G, 'A', 'D', weight='weight') ['A', 'B', 'D']
Distributed with a BSD license; see LICENSE.txt:
Copyright (C) 2004-2015 NetworkX Developers Aric Hagberg <email@example.com> Dan Schult <firstname.lastname@example.org> Pieter Swart <email@example.com>