NetworkX

.. image:: https://github.com/networkx/networkx/workflows/test/badge.svg?branch=main :target: https://github.com/networkx/networkx/actions?query=workflow%3Atest

.. image:: https://codecov.io/gh/networkx/networkx/branch/main/graph/badge.svg? :target: https://app.codecov.io/gh/networkx/networkx/branch/main

.. image:: https://img.shields.io/pypi/v/networkx.svg? :target: https://pypi.python.org/pypi/networkx

.. image:: https://img.shields.io/pypi/l/networkx.svg? :target: https://github.com/networkx/networkx/blob/main/LICENSE.txt

.. image:: https://img.shields.io/pypi/pyversions/networkx.svg? :target: https://pypi.python.org/pypi/networkx

.. image:: https://img.shields.io/github/labels/networkx/networkx/good%20first%20issue?color=green&label=contribute :target: https://github.com/networkx/networkx/contribute

NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.

• Website (including documentation): https://networkx.org
• Mailing list: https://groups.google.com/forum/#!forum/networkx-discuss
• Source: https://github.com/networkx/networkx
• Bug reports: https://github.com/networkx/networkx/issues
• Report a security vulnerability: https://tidelift.com/security
• Tutorial: https://networkx.org/documentation/latest/tutorial.html
• GitHub Discussions: https://github.com/networkx/networkx/discussions

Simple example

Find the shortest path between two nodes in an undirected graph:

.. code:: pycon

>>> 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

Install the latest released version of NetworkX:

.. code:: shell

$ pip install networkx

Install with all optional dependencies:

.. code:: shell

$ pip install networkx[default]

For additional details, please see the

Bugs

Please report any bugs that you find

License

Released under the

Copyright (C) 2004-2024 NetworkX Developers
Aric Hagberg <hagberg@lanl.gov>
Dan Schult <dschult@colgate.edu>
Pieter Swart <swart@lanl.gov>