NetworkX
========
.. image:: https://github.com/networkx/networkx/workflows/test/badge.svg?branch=main
:target: https://github.com/networkx/networkx/actions?query=workflow%3A%22test%22
.. 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/github/labels/networkx/networkx/Good%20First%20Issue?color=green&label=Contribute%20&style=flat-square
:target: https://github.com/networkx/networkx/issues?q=is%3Aopen+is%3Aissue+label%3A%22Good+First+Issue%22
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 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 <https://github.com/networkx/networkx/issues>`_.
Or, even better, fork the repository on `GitHub <https://github.com/networkx/networkx>`_
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-2024 NetworkX Developers
Aric Hagberg <hagberg@lanl.gov>
Dan Schult <dschult@colgate.edu>
Pieter Swart <swart@lanl.gov>
Raw data
{
"_id": null,
"home_page": null,
"name": "networkx",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.10",
"maintainer_email": "NetworkX Developers <networkx-discuss@googlegroups.com>",
"keywords": "Networks, Graph Theory, Mathematics, network, graph, discrete mathematics, math",
"author": null,
"author_email": "Aric Hagberg <hagberg@lanl.gov>",
"download_url": "https://files.pythonhosted.org/packages/04/e6/b164f94c869d6b2c605b5128b7b0cfe912795a87fc90e78533920001f3ec/networkx-3.3.tar.gz",
"platform": "Linux",
"description": "NetworkX\n========\n\n\n.. image:: https://github.com/networkx/networkx/workflows/test/badge.svg?branch=main\n :target: https://github.com/networkx/networkx/actions?query=workflow%3A%22test%22\n\n.. image:: https://codecov.io/gh/networkx/networkx/branch/main/graph/badge.svg\n :target: https://app.codecov.io/gh/networkx/networkx/branch/main\n \n.. image:: https://img.shields.io/github/labels/networkx/networkx/Good%20First%20Issue?color=green&label=Contribute%20&style=flat-square\n :target: https://github.com/networkx/networkx/issues?q=is%3Aopen+is%3Aissue+label%3A%22Good+First+Issue%22\n \n\nNetworkX is a Python package for the creation, manipulation,\nand study of the structure, dynamics, and functions\nof complex networks.\n\n- **Website (including documentation):** https://networkx.org\n- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss\n- **Source:** https://github.com/networkx/networkx\n- **Bug reports:** https://github.com/networkx/networkx/issues\n- **Report a security vulnerability:** https://tidelift.com/security\n- **Tutorial:** https://networkx.org/documentation/latest/tutorial.html\n- **GitHub Discussions:** https://github.com/networkx/networkx/discussions\n\nSimple example\n--------------\n\nFind the shortest path between two nodes in an undirected graph:\n\n.. code:: pycon\n\n >>> import networkx as nx\n >>> G = nx.Graph()\n >>> G.add_edge(\"A\", \"B\", weight=4)\n >>> G.add_edge(\"B\", \"D\", weight=2)\n >>> G.add_edge(\"A\", \"C\", weight=3)\n >>> G.add_edge(\"C\", \"D\", weight=4)\n >>> nx.shortest_path(G, \"A\", \"D\", weight=\"weight\")\n ['A', 'B', 'D']\n\nInstall\n-------\n\nInstall the latest version of NetworkX::\n\n $ pip install networkx\n\nInstall with all optional dependencies::\n\n $ pip install networkx[all]\n\nFor additional details, please see `INSTALL.rst`.\n\nBugs\n----\n\nPlease report any bugs that you find `here <https://github.com/networkx/networkx/issues>`_.\nOr, even better, fork the repository on `GitHub <https://github.com/networkx/networkx>`_\nand create a pull request (PR). We welcome all changes, big or small, and we\nwill help you make the PR if you are new to `git` (just ask on the issue and/or\nsee `CONTRIBUTING.rst`).\n\nLicense\n-------\n\nReleased under the 3-Clause BSD license (see `LICENSE.txt`)::\n\n Copyright (C) 2004-2024 NetworkX Developers\n Aric Hagberg <hagberg@lanl.gov>\n Dan Schult <dschult@colgate.edu>\n Pieter Swart <swart@lanl.gov>\n",
"bugtrack_url": null,
"license": null,
"summary": "Python package for creating and manipulating graphs and networks",
"version": "3.3",
"project_urls": {
"Bug Tracker": "https://github.com/networkx/networkx/issues",
"Documentation": "https://networkx.org/documentation/stable/",
"Homepage": "https://networkx.org/",
"Source Code": "https://github.com/networkx/networkx"
},
"split_keywords": [
"networks",
" graph theory",
" mathematics",
" network",
" graph",
" discrete mathematics",
" math"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "38e95f72929373e1a0e8d142a130f3f97e6ff920070f87f91c4e13e40e0fba5a",
"md5": "f90ec4e28ea102044975cd2d54c5aa5a",
"sha256": "28575580c6ebdaf4505b22c6256a2b9de86b316dc63ba9e93abde3d78dfdbcf2"
},
"downloads": -1,
"filename": "networkx-3.3-py3-none-any.whl",
"has_sig": false,
"md5_digest": "f90ec4e28ea102044975cd2d54c5aa5a",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.10",
"size": 1702396,
"upload_time": "2024-04-06T12:59:44",
"upload_time_iso_8601": "2024-04-06T12:59:44.283289Z",
"url": "https://files.pythonhosted.org/packages/38/e9/5f72929373e1a0e8d142a130f3f97e6ff920070f87f91c4e13e40e0fba5a/networkx-3.3-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "04e6b164f94c869d6b2c605b5128b7b0cfe912795a87fc90e78533920001f3ec",
"md5": "c307f8c790cf3f18954ae7458b16c843",
"sha256": "0c127d8b2f4865f59ae9cb8aafcd60b5c70f3241ebd66f7defad7c4ab90126c9"
},
"downloads": -1,
"filename": "networkx-3.3.tar.gz",
"has_sig": false,
"md5_digest": "c307f8c790cf3f18954ae7458b16c843",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.10",
"size": 2126579,
"upload_time": "2024-04-06T12:59:47",
"upload_time_iso_8601": "2024-04-06T12:59:47.137266Z",
"url": "https://files.pythonhosted.org/packages/04/e6/b164f94c869d6b2c605b5128b7b0cfe912795a87fc90e78533920001f3ec/networkx-3.3.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-04-06 12:59:47",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "networkx",
"github_project": "networkx",
"travis_ci": false,
"coveralls": true,
"github_actions": true,
"circle": true,
"lcname": "networkx"
}
JSON
