-
-
Notifications
You must be signed in to change notification settings - Fork 3.4k
Insights: networkx/networkx
Overview
-
- 5 Merged pull requests
- 8 Open pull requests
- 4 Closed issues
- 0 New issues
Could not load contribution data
Please try again later
5 Pull requests merged by 3 people
-
Fix typo in
min_edge_coverdocstring#8075 merged
May 29, 2025 -
Clarify subgraph node/edge order is not preserved
#8069 merged
May 27, 2025 -
Minor refactor to cleanup/improve matching test suite
#8068 merged
May 26, 2025 -
Fix edge case in ISMAGS symmetry detection
#8055 merged
May 26, 2025 -
Add note about cycles in
maximum_flow()#8058 merged
May 22, 2025
8 Pull requests opened by 5 people
-
SCC benchmarks and use of `G._adj` in Tarjan algorithm
#8064 opened
May 23, 2025 -
Er polarity graph generator
#8066 opened
May 26, 2025 -
Replace `random_lobster` with `random_lobster_graph`
#8067 opened
May 26, 2025 -
Make subgraph node order same as the original graph at least for typical usage
#8070 opened
May 27, 2025 -
Clarify order preservation as a public contract in graph documentation
#8071 opened
May 27, 2025 -
Refactor `is_*matching` checks
#8072 opened
May 27, 2025 -
Adding an example on how to extend NetworkX with sorted graphs
#8073 opened
May 28, 2025 -
Error handling consistency in `is_*matching`
#8074 opened
May 28, 2025
4 Issues closed by 2 people
-
ISMAGS trips AssertionError for specific symmetry patterns
#4915 closed
May 26, 2025 -
Wrong attribution of eigenvector centrality
#6004 closed
May 23, 2025 -
Loading DOT string with pydot subsystem: get_strict() fails
#8063 closed
May 22, 2025 -
maximum_flow() bug
#6740 closed
May 22, 2025
14 Unresolved conversations
Sometimes conversations happen on old items that aren’t yet closed. Here is a list of all the Issues and Pull Requests with unresolved conversations.
-
Faster `intersection_array` computation for checking distance-regularity
#7181 commented on
May 27, 2025 • 7 new comments -
Add input validation to `non_randomness()` and clarify its behavior
#8057 commented on
May 24, 2025 • 4 new comments -
Fix `min_weight_matching`
#8062 commented on
May 26, 2025 • 4 new comments -
Long node names break nx_pydot.pydot_layout (and possibly others)
#7648 commented on
May 27, 2025 • 0 new comments -
Issue with `optimize_edit_paths`: Order of `list(G1.nodes)` & `list(G2.nodes)`
#8054 commented on
May 28, 2025 • 0 new comments -
Girvan-Newman Improvement: component-wise computing + incremental shortest-path calculation
#8000 commented on
May 25, 2025 • 0 new comments -
Add new method for interval_graph().
#8003 commented on
May 25, 2025 • 0 new comments -
Optimizing Dijkstra's paths to target (~27x faster for graphs with multiple-hops shortest path)
#8023 commented on
May 27, 2025 • 0 new comments -
Fixes #6873 - MEO/PEO handling in `chordal.py`
#8024 commented on
May 27, 2025 • 0 new comments -
Adding support for type-based backend dispatch
#8035 commented on
May 23, 2025 • 0 new comments -
k-lift
#8045 commented on
May 27, 2025 • 0 new comments -
Avoid re-exploring nodes in Kosaraju's SCC algorithm
#8056 commented on
May 26, 2025 • 0 new comments -
Add benchmark suite for shortest path algorithms on weighted graphs
#8059 commented on
May 27, 2025 • 0 new comments -
Make dominance functions consistent with definitions
#8061 commented on
May 23, 2025 • 0 new comments