Network Analysis in Python 创建、操作和研究复杂网络结构的 Python 库

这是一个用来创建、操作和研究复杂网络结构的 Python 库，内置常用的数据结构和图算法，支持生成无向图(Graph)、有向图(DiGraph)、多重无向图(MultiGraph)、多重有向图(MultiDiGraph)，可用于图论研究、原型设计、教学等场景。 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: >>> 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 version of NetworkX: $ pip install networkx Install with all optional dependencies: $ pip install networkx[all] For additional details, please see INSTALL.rst. Bugs Please report any bugs that you find here. Or, even better, fork the repository on 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 CONTRIBUTING.rst). License Released under the 3-Clause BSD license (see LICENSE.txt): Copyright (C) 2004-2023 NetworkX Developers Aric Hagberg <hagberg@lanl.gov> Dan Schult <dschult@colgate.edu> Pieter Swart <swart@lanl.gov>