v0.2
nx-parallel 0.2
We're happy to announce the release of nx-parallel 0.2!
Enhancements
- parallel implementation for all_pairs_bellman_ford_path (#14).
- benchmarking infrastructure (#24).
- ENH : Adding
backend_infoentry point (#27). - ENH : added
johnsoninweighted.py(#37). - ENH : added
square_clustering(#34). - ENH : improved
all_pairs_bellman_ford_path(#49). - ENH : added
node_redundancyinbipartite(#45). - ENH : adding parallel implementations of
all_pairs_algos (#33). - [ENH, BUG] : added
time_tournament_is_strongly_connectedbenchmark, renamedtournament_is_strongly_connectedtois_strongly_connected(#32). - ENH : Added
get_chunkstobetweenness_centralityandcreate_iterablesinutils(#29).
Bug Fixes
- BUG: moved
get_infofrombackend.pyto_nx_parallel(#53). - BUG : included
_nx_parallelin packages (#54).
Documentation
Maintenance
- replaced networkx_plugin with networkx_backend (#25).
- replaced networkx.plugins with networkx.backends and updated readme (#26).
- Sync up min python version with networkx main repo (#31).
- MAINT : updated
pre-commit-config.yaml(#35). - MAINT : added lint workflow test (#28).
- MAINT : styling fixes (#38).
- MAINT : style fix - 2 (#40).
- MAINT : added
default_benchmark_timeouttoasv.conf.json(#43). - MAINT : removed
NETWORKX_GRAPH_CONVERT(#48). - MAINT: updating backend.get_info (#47).
- MAINT: renamed backend function keys (#50).
- MAINT: added script to update
_nx_parallel/__init__.py(#57). - MAINT: Renaming functions with a different name while dispatching (#56).
- MAINT: updated
READMEand_nx_parallel/__init__.py(#58). - MAINT: Added LICENSE and updated README (#59).
- Use pypi for tests (#64).
Contributors
4 authors added to this release (alphabetically):
- Aditi Juneja (@Schefflera-Arboricola)
- Dan Schult (@dschult)
- Jarrod Millman (@jarrodmillman)
- Mridul Seth (@MridulS)
5 reviewers added to this release (alphabetically):
- Aditi Juneja (@Schefflera-Arboricola)
- Dan Schult (@dschult)
- Jarrod Millman (@jarrodmillman)
- Mridul Seth (@MridulS)
- Ross Barnowski (@rossbar)
These lists are automatically generated, and may not be complete or may contain duplicates.