NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.
Find 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']
Install the latest released version of NetworkX:
$ pip install networkx
Install with all optional dependencies:
$ pip install networkx[default]
For additional details, please see the Bugs
Please report any bugs that you find GitHub and create a pull request (PR). We welcome all changes, big or small, and we will help you make the PR if you are new to git (just ask on the issue and/or see the License