18
I Use This!
High Activity

Commits : Listings

Analyzed 1 day ago. based on code collected 1 day ago.
Aug 02, 2025 — Sep 01, 2025
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
Adding shortest-paths documentation (#8187) More... 2 days ago
fix `optimize_edit_paths` handling of self-loops (#8207) More... 2 days ago
Rm networkx.algorithms.threshold.swap_d. (#8213) More... 2 days ago
MAINT: Rm print from threshold_graph (#8212) More... 3 days ago
Improve docs for `all_neighbors()` (#8166) More... 3 days ago
BUG: Raise on directed graphs in `nx.find_cliques_recursive` (#8211) More... 4 days ago
STY: Variable rename proposal in bidirectional_dijkstra (#8210) More... 5 days ago
Bidirectional dijkstra optimization: from 1.1x to 25x faster (#8206) More... 5 days ago
Add hyper_wiener_index function (#8184) More... 6 days ago
MAINT: Ignore graph hashing warnings in tests (#8205) More... 10 days ago
Add GEXF 1.3 to the recognized GEXF versions (#8196) More... 12 days ago
trust rank implementation and testing (#8165) More... 17 days ago
MAINT: remove `try except` for `tomllib` in `generate_requirements` (#8198) More... 19 days ago
MAINT: use `matrix_power` from `scipy.sparse` in `number_of_walks` (#8197) More... 19 days ago
Ensure PlanarEmbedding is pickleable More... 25 days ago
Avoid re-exploring nodes in Kosaraju's SCC algorithm (#8056) More... 26 days ago
Add benchmarks for is_regular. (#8173) More... 29 days ago
chore: make benchmarking and release requirements extras in `pyproject.toml` (#8172) More... 29 days ago
enh: short-circuit in `is_regular` for directed graphs (#8138) More... 29 days ago
3d facebook plot example (#6893) More... about 1 month ago