Home

132 unique items

Completion ETA: ~2025-12-12

Assi Unresponded, older than 3 days Needs Review
nobody
#7468 Refactor "loopback" testing backend to also serve as an example backend
#6822 LFR_benchmark_graph : community size validation can result in impossible values
#6809 LFR_benchmark_graph : graph generation does not preserve degree distribution
#6763 LFR_benchmark_graph missing condition check
#6762 LFR_benchmark_graph incorrect condition in loop
#6300 Add common_neighbors support for directed graphs
#5729 inefficiency of Steiner tree
#6719 GraphML export attribute types are opaque and unintuitive
#5609 drawing multiedges especially with labels does not work
#5472 Adding examples on functions related to graph covers
#5012 Implementation of newman_watts_strogatz_graph inconsistent with model
#4215 New Algorithm to Check Planarity
#3899 Missing Uniform Cost Search for tree like structures
#3834 Add normalized adjacency matrix and normalized adjacency spectrum
#8214 TST: Test maintenance for `test_clique.py`
#8045 create new generator that returns a random k-lift of a d-regular graph
#8255 Draw functions wraps `display`
#5890 use plain inheritance instead of class variables
#8349 ENH: Vectorized implementation for weighted clustering
#8344 CI: Build docs in parallel
#8066 projective polarity graph generator
#7875 Propagate timeout to `optimal_edit_paths` and `optimize_graph_edit_distance`
#8270 MAINT/TST: bring coverage to 100% for `approximation/density.py`
#8019 Add algorithm bipartite ged
#8283 Directed Steiner Tree approximation
#8268 MAINT: `louvain`: avoid multiple `is_directed` checks and clean up autoformatting in helper
#7957 Add modular decomposition algorithm
#8200 MAINT: Consolidate bipartite Havel--Hakimi graph generators
#8202 Expander decomposition and cut finding algorithms
#8260 MAINT: consolidate cost matrix initialization in `similarity.py`
#8094 Add image tests pytest-mpl to the CI
#8199 ENH: add `johnson_graph` to generate Johnson graphs
#8148 fix: add suggestions from #8021 and #8029 to `is_aperiodic`
#8179 maint: performance/readability improvements for `convert.py`
#8181 feat: make `ramsey_R2` nonrecursive
#7484 Allow named/multiple arguments for `@not_implemented_for()`
#6919 Add Gradient Network graph generator
#7475 Various improvements in information centrality
#8118 Slimfly ring
#7777 Inconsistent behavior for simple and multi undirected graph when using from_numpy_array
#7788 added edge-disjoint multiple_paths
#6364 Addition of Social Aware Assignment Algorithm to NetworkX Library (Coalition Formation in Multi-agent Systems)
#8035 Adding support for type-based backend dispatch
#8053 Add `newman_watts_graph`
#7602 Add `_dispatchable._get_convert_kwargs` method for more composability
#8000 Girvan-Newman Improvement: component-wise computing + incremental shortest-path calculation
#7988 Lowest common ancestor improvements and fixes
#7981 Adding Hypothesis framework for NetworkX
#7297 Allow backend kwargs to be passed via special keywords `<backend>_kwargs=`
#7485 Add `nx.config.backend` option
#7817 Update usage of "Yields" section
#7827 MAINT: Try speed up core views and use _adj dictionary directly
#6642 Katz centrality scipy
#6627 Added Katz index
#4679 feat: add alg for shortest path with turn restrictions
#7258 Test whether function should use Yields instead of Returns
#7600 Allow backend graphs to be tested as compatible NetworkX graphs
#7259 Allow backend graphs to be input to `nx.Graph(data)`
#7138 Edge Coloring for bipartite graphs
#6344 PR to find envy-free matchings in bipartite-graphs
#7489 Improve test coverage and docstrings for `generators/classic`
#7369 add Backend Protocol to aid backend developers
#6805 ADD: Voting-based centrality indices
#6755 Implement generators for fractal graphs
#5497 Tests for decay centrality
#7088 Implements Bonacich power centrality (networkx#7078)
#4804 Approximation algorithms for traveling salesman problem
#4566 Enhancement issue 3657
#5947 [ENH] MixedEdgeGraph for enablement of causal graphs
#6811 LFR_benchmark_graph : wiring algorithm fix to generate desired degree distribution
#6738 DICN Link Prediction Implementation
#6175 Fix performance issue in VF2 matching with unconnected graphs
#6730 Add Dulmage-Mendelsohn decomposition to `algorithms.bipartite.matching`
#6557 Improve `quotient_graph` efficiency
#4706 combinatorial_embedding_to_pos, specify outer face
#4534 Minimum Multiway Cut and k-cut
#6236 Add conversion functions for node/edge_match to Graph based labels
#5041 Added leverage centrality algorithm
#5585 Rank maximal matching
#5031 Polymorphic isomorphism
#6714 Fix dfs_postorder_nodes function
#6665 Add source as a general parameter to TSP solvers
#6410 Added a faster version of undirected weighted one-mode projection. Wi…
#6372 Maximum Priority Matching
#6376 New functions for efficient subgraph isomorphism using genetic algorithm in networkx
#6309 Improving the Time and Space Complexity of the Tree Isomorphism Algorithm.
#6291 Fix ineffective `nodes` args of graph6 writers
#4496 [DRAFT] Autogenerating lazy initialization everywhere
#5979 Refactoring assortativity by issue 4936
#6193 Max weight frac match
#6112 changed edge weights for max weight matching and added test
#3792 Implemented topo_layout for DAGs
#5886 Add very basic type stubs
#5950 Standardized force layout tests
#4327 Add maximum_common_ordered_subtree_embedding to algorithms.minors
#5821 Proof of concept: Rich Graphs
#5494 Fix docstrings
#5411 Added Lemke graph
#5299 Update gml exporter to allow set property values
#5073 Simplify code for MyPy and repair MyPy errors
#4664 Add removal of edges from planar embeddings
#4598 Add rewiring optimizers for simulating annealing and hill climbing meta-heuristics
#4571 Display D3.js plots inline in documentation
#4551 Improve plotting of self-loops
#4468 Add hierarchical layout
#4423 CNFG Link Prediction Algorithm Implementation
#4151 added iteration counter to asyn_lpa_communities for early exit when m…
#4144 Add strong connectivity augmentation
#3817 Remove position offset from periodic lattice tilings
#3248 custom attribute composition in graphml
#2316 Approximate minimum feedback vertex set
#2153 Canadian Traveller Problem
#2117 Branchings.py - Removed graphs and branchings structures in favor of an unique for unrolling the circuits
#2053 Added simple disjoint path computation
#1811 Tree isomorphism
#1737 Adds cumulative nomination scheme centrality.
#1618 Nearly complete alteration to k_core and core_number to add in-cores and out-cores
#1464 Add exact algorithm for minimum dominating set
#1560 Democratic Estimate of the Modular Organization of a Network

#4148 Reverse Cuthill-McKee ordering to reduce the bandwidth of matrices
🌊

#3978 Add distinctiveness centrality
🌊

#3897 added basic uniform cost search listing edges
🌊

#3393 Find all trails in a directed graph
🌊

#4822 Functions for computing a cycle basis refreshed
🌊

#4421 Implement linear controllability algorithms
🌊

#4647 Adding hierarchy coordinates
🌊

#4221 Add max common induced subgraph
🌊

#3923 Consistent dijkstra api
🌊

#3835 Add normalized adjacency matrix functions
🌊

#3870 Add dendro from graphs
🌊

#3873 Add exact graph coloring
🌊

#1031 Add stochastic Kronecker graph model to networkx.generators
🌊
Triage Party v1.4.0