{"id":13398727,"url":"https://github.com/networkx/networkx","last_synced_at":"2025-05-12T15:07:46.408Z","repository":{"id":1057481,"uuid":"890377","full_name":"networkx/networkx","owner":"networkx","description":"Network Analysis in Python","archived":false,"fork":false,"pushed_at":"2025-05-04T01:17:12.000Z","size":95213,"stargazers_count":15701,"open_issues_count":365,"forks_count":3346,"subscribers_count":282,"default_branch":"main","last_synced_at":"2025-05-05T11:11:26.857Z","etag":null,"topics":["complex-networks","graph-algorithms","graph-analysis","graph-generation","graph-theory","graph-visualization","python"],"latest_commit_sha":null,"homepage":"https://networkx.org","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/networkx.png","metadata":{"files":{"readme":"README.rst","changelog":null,"contributing":"CONTRIBUTING.rst","funding":null,"license":"LICENSE.txt","code_of_conduct":"CODE_OF_CONDUCT.rst","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null},"funding":{"github":["networkx"],"open_collective":"networkx"}},"created_at":"2010-09-06T00:53:44.000Z","updated_at":"2025-05-05T06:26:24.000Z","dependencies_parsed_at":"2023-02-17T06:00:56.551Z","dependency_job_id":"ea46a045-f82a-4684-856f-2a6246743b90","html_url":"https://github.com/networkx/networkx","commit_stats":{"total_commits":6880,"total_committers":765,"mean_commits":8.993464052287582,"dds":0.8008720930232558,"last_synced_commit":"5c3e8beef128f532b536d2d4a9f7e309ed53416b"},"previous_names":[],"tags_count":96,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/networkx%2Fnetworkx","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/networkx%2Fnetworkx/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/networkx%2Fnetworkx/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/networkx%2Fnetworkx/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/networkx","download_url":"https://codeload.github.com/networkx/networkx/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252497933,"owners_count":21757714,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["complex-networks","graph-algorithms","graph-analysis","graph-generation","graph-theory","graph-visualization","python"],"created_at":"2024-07-30T19:00:31.123Z","updated_at":"2025-05-05T12:34:16.491Z","avatar_url":"https://github.com/networkx.png","language":"Python","readme":"NetworkX\n========\n\n\n.. image::\n    https://github.com/networkx/networkx/workflows/test/badge.svg?branch=main\n    :target: https://github.com/networkx/networkx/actions?query=workflow%3Atest\n\n.. image::\n    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::\n    https://img.shields.io/pypi/v/networkx.svg?\n    :target: https://pypi.python.org/pypi/networkx\n\n.. image::\n    https://img.shields.io/pypi/l/networkx.svg?\n    :target: https://github.com/networkx/networkx/blob/main/LICENSE.txt\n\n.. image::\n    https://img.shields.io/pypi/pyversions/networkx.svg?\n    :target: https://pypi.python.org/pypi/networkx\n\n.. image::\n    https://img.shields.io/github/labels/networkx/networkx/good%20first%20issue?color=green\u0026label=contribute\n    :target: https://github.com/networkx/networkx/contribute\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- **Discord (Scientific Python) invite link:** https://discord.com/invite/vur45CbwMz\n- **NetworkX meetings calendar (open to all):** https://scientific-python.org/calendars/networkx.ics\n\nSimple example\n--------------\n\nFind the shortest path between two nodes in an undirected graph:\n\n.. code:: pycon\n\n    \u003e\u003e\u003e import networkx as nx\n    \u003e\u003e\u003e G = nx.Graph()\n    \u003e\u003e\u003e G.add_edge(\"A\", \"B\", weight=4)\n    \u003e\u003e\u003e G.add_edge(\"B\", \"D\", weight=2)\n    \u003e\u003e\u003e G.add_edge(\"A\", \"C\", weight=3)\n    \u003e\u003e\u003e G.add_edge(\"C\", \"D\", weight=4)\n    \u003e\u003e\u003e nx.shortest_path(G, \"A\", \"D\", weight=\"weight\")\n    ['A', 'B', 'D']\n\nInstall\n-------\n\nInstall the latest released version of NetworkX:\n\n.. code:: shell\n\n    $ pip install networkx\n\nInstall with all optional dependencies:\n\n.. code:: shell\n\n    $ pip install networkx[default]\n\nFor additional details,\nplease see the `installation guide \u003chttps://networkx.org/documentation/stable/install.html\u003e`_.\n\nBugs\n----\n\nPlease report any bugs that you find `here \u003chttps://github.com/networkx/networkx/issues\u003e`_.\nOr, even better, fork the repository on `GitHub \u003chttps://github.com/networkx/networkx\u003e`_\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 the `contributor guide \u003chttps://networkx.org/documentation/latest/developer/contribute.html\u003e`_).\n\nLicense\n-------\n\nReleased under the `3-Clause BSD license \u003chttps://github.com/networkx/networkx/blob/main/LICENSE.txt\u003e`_::\n\n    Copyright (C) 2004-2024 NetworkX Developers\n    Aric Hagberg \u003chagberg@lanl.gov\u003e\n    Dan Schult \u003cdschult@colgate.edu\u003e\n    Pieter Swart \u003cswart@lanl.gov\u003e\n","funding_links":["https://github.com/sponsors/networkx","https://opencollective.com/networkx","https://tidelift.com/security"],"categories":["Python","Science","\u003ca id=\"79499aeece9a2a9f64af6f61ee18cbea\"\u003e\u003c/a\u003e浏览嗅探\u0026\u0026流量拦截\u0026\u0026流量分析\u0026\u0026中间人","图数据处理","\u003cspan id=\"head81\"\u003e3.12. Agents, Graph and Networks\u003c/span\u003e","Graph","\u003ca id=\"64f068672e615343db9235f1973d8fba\"\u003e\u003c/a\u003e网络数据包","Graph Manipulation","图机器学习库","Graph Data","Basic Components","Uncategorized","ریاضی","Synopsis","🐍 Python","Libraries"],"sub_categories":["\u003ca id=\"99398a5a8aaf99228829dadff48fb6a7\"\u003e\u003c/a\u003e未分类-Network","\u003cspan id=\"head66\"\u003e3.10.2. Global Sensitivity Anylysis\u003c/span\u003e","Others","\u003ca id=\"b239f12aca7aa942b45836032cbef99a\"\u003e\u003c/a\u003e转换","网络服务_其他","Tools \u0026 Projects","Fundamental libraries","Uncategorized","کار با زمان و تقویم","Table of Contents","Useful Python Tools for Data Analysis"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnetworkx%2Fnetworkx","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnetworkx%2Fnetworkx","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnetworkx%2Fnetworkx/lists"}