{"full_name":"networkx/networkx","owner":"networkx","name":"networkx","shard":"1","url":"https://github.com/networkx/networkx","description":"Network Analysis in Python","homepage":"https://networkx.org","topics":["python","complex-networks","graph-theory","graph-algorithms","graph-analysis","graph-generation","graph-visualization"],"tag_pages":["python"],"language":"Python","license":"NOASSERTION","avatar":"https://avatars.githubusercontent.com/u/388785?v=4","created_at":"2010-09-06T00:53:44Z","pushed_at":"2026-11-15T03:49:48Z","metrics":{"stars":17394,"forks":3666,"watchers":275,"issues":3430,"prs":4904,"releases":67,"issues_open":122,"issues_closed":3308,"prs_open":184,"prs_closed":1124,"prs_merged":3596,"discussions":574},"growth":{"day":{"stars":2,"forks":-2,"base_day":"2026-11-15"}},"history":{"dates":["2026-11-10","2026-11-11","2026-11-12","2026-11-13","2026-11-14","2026-11-15","2026-11-16"],"stars":[17392,17391,17391,17392,17392,17392,17394],"forks":[3662,3666,3666,3666,3669,3668,3666],"watchers":[null,275,275,275,275,275,275],"issues_open":[null,124,122,122,122,122,122],"prs_open":[null,187,185,185,185,184,184]},"boards":{},"same_owner":[],"issues":[{"number":4973,"title":"Request for adding more centrality algorithms","comments":25,"created_at":"2021-07-14T08:11:41Z"},{"number":6873,"title":"Review maximum cardinality search algorithm in `complete_to_chordal_graph`","comments":22,"created_at":"2023-08-23T04:50:04Z"},{"number":3825,"title":"ENH: New algorithm for nx.minimum_spanning_arborescence()","comments":16,"created_at":"2020-02-20T15:33:34Z"},{"number":4516,"title":"Add edge ID attribute to nx.readwrite.json_graph.cytoscape_data(G)","comments":15,"created_at":"2021-01-03T19:16:59Z"},{"number":3010,"title":"partial mappings for subgraph-isomorphism","comments":14,"created_at":"2018-06-13T12:52:02Z"},{"number":7992,"title":"Improve Girman-Newman speed","comments":13,"created_at":"2025-04-22T03:08:57Z"},{"number":7913,"title":"cytoscape JSON is not valid","comments":13,"created_at":"2025-03-18T16:30:10Z"},{"number":6870,"title":"Performance regression in connected components (maybe?)","comments":13,"created_at":"2023-08-22T11:59:09Z"}],"discussions":[{"number":8999,"title":"Exact Steiner tree backend?","comments":1,"category":"Ideas","created_at":"2026-11-08T20:49:44Z"},{"number":8998,"title":"Why are  there no reliability networks with e.g. the reliability polynomial?","comments":0,"category":"Algorithms","created_at":"2026-11-07T12:26:41Z"},{"number":8991,"title":"Should our drawing docs point to iplotx and display?","comments":2,"category":"Ideas","created_at":"2026-11-03T13:49:20Z"},{"number":8971,"title":"Proposal: Global minimum cut using only cut-capacity comparisons","comments":0,"category":"Algorithms","created_at":"2026-10-25T09:31:55Z"},{"number":8933,"title":"pyarrow backend","comments":2,"category":"Ideas","created_at":"2026-09-30T18:35:34Z"},{"number":8768,"title":"~2x speedup for (edge_)betweenness_centrality via integer relabeling + flat-list Brandes kernel (pure Python)","comments":0,"category":"Algorithms","created_at":"2026-07-17T16:14:48Z"},{"number":8763,"title":"Proposal: ALT landmark heuristic for astar_path (A*, Landmarks, Triangle inequality)","comments":1,"category":"Algorithms","created_at":"2026-07-15T13:13:57Z"},{"number":8720,"title":"Add count_eulerian_circuit() api in eulerian section of networkx via BEST theorem","comments":0,"category":"Algorithms","created_at":"2026-06-25T03:53:00Z"}],"latest_release":{"name":"NetworkX 3.7","tag":"networkx-3.7","published_at":"2026-09-21T16:46:13Z","body":"# networkx 3.7\r\n\r\nWe're happy to announce the release of networkx 3.7!\r\n\r\n## Highlights\r\n\r\n- The isomorphism checking suite of tools has been upgraded. The VF2++ functions now provide subgraph isomorphism and subgraph monomorphism checking ([#8506](https://github.com/networkx/networkx/pull/8506)).\r\n- Leiden based community detection algorithms are now supported via `leiden_communities` and `leiden_partitions`. This provides an alternative, often improved, community detection algorithm compared to the Louvain functions ([#8509](https://github.com/networkx/networkx/pull/8509)).\r\n- The pygraphviz library is now provided via `pip` with wheels that include the GraphViz binaries. This should make the NetworkX interface to pygraphviz easier to use for graph layout and rendering ([#8694](https://github.com/networkx/networkx/pull/8694)).\r\n\r\n## API Changes\r\n\r\n- Expire random lobster dep ([#8499](https://github.com/networkx/networkx/pull/8499)).\r\n- API: Expire deprecations of could-be isomorphism aliases ([#8498](https://github.com/networkx/networkx/pull/8498)).\r\n- Proposal to deprecate `bfs_predecessors` ([#8494](https://github.com/networkx/networkx/pull/8494)).\r\n- Change maximal_independent_set to return set instead of list ([#8564](https://github.com/networkx/networkx/pull/8564)).\r\n- Add centroid as alias to barycenter ([#8622](https://github.com/networkx/networkx/pull/8622)).\r\n- API: Deprecate p2g module ([#8855](https://github.com/networkx/networkx/pull/8855)).\r\n\r\n## Enhancements\r\n\r\n- Adding the Tree Optimization in Floyd Warshall ([#8361](https://github.com/networkx/networkx/pull/8361)).\r\n- Kruskal MST early break for efficiency ([#8296](https://github.com/networkx/networkx/pull/8296)).\r\n- create new generator that returns a random k-lift of a d-regular graph ([#8045](https://github.com/networkx/networkx/pull/8045)).\r\n- Floyd Warshall: Adding support for weight parameter as a callable ([#8386](https://github.com/networkx/networkx/pull/8386)).\r\n- [ENH] Flow algorithms: Add support for callable capacity parameter ([#8406](https://github.com/networkx/networkx/pull/8406)).\r\n- fix: add suggestions from #8021 and #8029 to `is_aperiodic` ([#8148](https://github.com/networkx/networkx/pull/8148)).\r\n- Improve chordal code readability by removing helper function ([#8479](https://github.com/networkx/networkx/pull/8479)).\r\n- FEAT: Added basic random walk utilities #8378 ([#8383](https://github.com/networkx/networkx/pull/8383)).\r\n- Implement Constant-Potts Model (for use with Leiden community detection) ([#8507](https://github.com/networkx/networkx/pull/8507)).\r\n- The isomorphism checking suite of tools has been upgraded. The VF2++ functions now provide subgraph isomorphism and subgraph monomorphism checking ([#8506](https://github.com/networkx/networkx/pull/8506)).\r\n- Adding optional sp arg to closeness_centrality ([#8424](https://github.com/networkx/networkx/pull/8424)).\r\n- perf: replace built-in sum() with np.sum() in pagerank and katz ([#8561](https://github.com/networkx/networkx/pull/8561)).\r\n- ENH: Add format parameter to adjacency_matrix ([#8545](https://github.com/networkx/networkx/pull/8545)).\r\n- Proposal: Add density to `nx.describe` defaults ([#8569](https://github.com/networkx/networkx/pull/8569)).\r\n- Add utility to extract faces from PlanarEmbedding ([#8512](https://github.com/networkx/networkx/pull/8512)).\r\n- Improving views exceptions ([#8588](https://github.com/networkx/networkx/pull/8588)).\r\n- Optimize `_build_paths_from_predecessors` stack logic for 30-40% speedup ([#8460](https://github.com/networkx/networkx/pull/8460)).\r\n- EHN: Add nonedge argument to from_numpy_array and complete the roundtrip ([#8552](https://github.com/networkx/networkx/pull/8552)).\r\n- State-of-the-art implementation of Tarjan's algorithm ([#8615](https://github.com/networkx/networkx/pull/8615)).\r\n- Add description and keywords support to GEXF reader/writer ([#8629](https://github.com/networkx/networkx/pull/8629)).\r\n- DOC: more `barycenter` and `centroid` ","is_prerelease":false},"readme":false,"readme_zh":false,"news":[],"stale":false,"snapshot_at":"2026-11-16T09:23:14Z","history_start":"2026-09-06"}