Path to this page:
./
math/py-networkx,
Python package for creating and manipulating graphs and networks
Branch: CURRENT,
Version: 3.6.1,
Package name: py313-networkx-3.6.1,
Maintainer: pkgsrc-usersNetworkX (NX) is a Python package for the creation, manipulation, and
study of the structure, dynamics, and functions of complex networks.
Features:
- Includes standard graph-theoretic and statistical physics functions
- Easy exchange of network algorithms between applications,
disciplines, and platforms
- Includes many classic graphs and synthetic networks
- Nodes and edges can be "anything"
(e.g. time-series, text, images, XML records)
- Exploits existing code from high-quality legacy software in C,
C++, Fortran, etc.
- Open source (encourages community input)
- Unit-tested
Required to run:[
devel/py-setuptools] [
devel/py-decorator] [
lang/python37]
Required to build:[
pkgtools/cwrappers]
Master sites:
Filesize: 2458.032 KB
Version history: (Expand)
- (2025-12-15) Updated to version: py313-networkx-3.6.1
- (2025-10-24) Package has been reborn
- (2025-10-24) Package deleted from pkgsrc
- (2025-10-09) Updated to version: py313-networkx-3.5
- (2025-07-15) Package has been reborn
- (2025-07-15) Package deleted from pkgsrc
CVS history: (Expand)
2025-12-15 13:05:15 by Adam Ciarcinski | Files touched by this commit (3) |  |
Log message:
py-networkx: updated to 3.6.1
networkx 3.6.1
API Changes
- Add spectral bipartition community finding and greedy bipartition using node swaps
Enhancements
- Nodelists for ``from_biadjacency_matrix``
- Add spectral bipartition community finding and greedy bipartition using node swaps
- Fix draw_networkx_nodes with list node_shape and add regression test
Bug Fixes
- Fix: allow graph subclasses to have additional arguments
Documentation
- DOC: Improve benchmarking readme
- DOC: More details re: RC releases in the release process devdocs
- DOC: clarify difference between G.nodes/G.nodes() and G.edges/G.edges() in tutorial
- DOC: Add blurb to contributor guide about drawing tests
- DOC: Fix underline lens in docstrings
- Rolling back shortest paths links
|
| 2025-10-09 10:02:00 by Thomas Klausner | Files touched by this commit (35) |
Log message:
*: remove more references to (removed) Python 3.9
|
2025-06-04 14:32:02 by Adam Ciarcinski | Files touched by this commit (3) |  |
Log message:
py-networkx: updated to 3.5
networkx 3.5
API Changes
- Save Layouts on Graphs
- Expire d_separated and minimum_d_separator functions
- Expire all_triplets deprecation
- Expire random_triad deprecation
- DEP: Raise an exception for k_core functions with multigraphs
- Deprecate graph_could_be_isomorphic
- Expire total_spanning_tree_weight deprecation
- Expire deprecation of create kwarg in nonisomorphic_trees
- New draw API
Enhancements
- perf: optimise ``random_k_out_graph``
- Clausets local community detection algorithm
- ``find_asteroidal_triple`` improvement
- Add ``weight`` to harmonic_diameter
- Densest Subgraph Problem: Greedy Peeling and Greedy++ Implementations
- single_source_all_shortest_paths: don't loop over all nodes
- Error message improvement for nbunch_iter ( NetworkXError raised with specific \
message on TypeError with "iter" in msg )
- Faster computation of energy in Laplacian centrality
- Make ``forceatlas2_layout`` dispatchable
- Update dispatchable for ``forceatlas2_layout``
- Enable backend-only functions where NetworkX is just an API
- Steinertree kou enhancement in response to issue 5889 type:Enhancements
- Add Leiden as a backend-only algorithm
- Bipartite layout nodes optional
- Densest Subgraph Problem: FISTA based algorithm + Large scale tests
- Dispatch ``get_node_attributes`` and a few more from ``nx.classes.function``
- Faster ``could_be_isomorphic`` and ``number_of_cliques``
- Add square_clustering to algorithm benchmarks
- Faster Implementation of Structural Holes
- Improve runtime of number_of_nonisomorphic_trees()
- Fix write_gexf timeformat for dynamic Graphs
- Consolidate could_be_isomorphic
- Improving rooted_tree_isomorphism for deep trees
- Fixing nx.diameter inconsistent results with usebounds=True
- Faster ``square_clustering``
- Avoid repeated cache conversion failures for backends
- Improve _sparse_fruchterman_reingold with L-BFGS
- Improve Performance of Tree Isomorphism and Center Calculation
- Add option for ``biadjacency_matrix`` to be returned as a dense NumPy array
- Add Functions for Finding Connected Dominating Sets
- Add feature to make storing node contraction data optional
- Added "initial_node" param to generate_random_paths() to allow a \
starting node to be specified for generated walks
- Fix behavior for iterable ``sources`` argument in ``bfs_layers``
- Speed up ``connected_components`` and ``weakly_connected_components``
- BiRank Algorithm Implementation
- Enforce correct graph types for graph matchers
Bug Fixes
- Update ``_raise_on_directed`` to work with ``create_using`` pos arg
- trophic_levels now checks for paths from each node to a basal node
- Fix TSP weight parameter issues
- Fix for filtered MultiGraph views from ``edge_subgraph``
- BUG: fixed the ``if`` condition in ``asadpour_atsp``
- Implement Bar ConnectionStyle for labels
- Fixed a divide by zero error in forceatlas2
- Fix for issue 7645: Do not preserve 'cw' and 'ccw' attributes in \
PlanarEmbedding.to_undirected()
- fix typo in ramanujan branch
- Fix ``with nx.config(backend_priority=backends):``
- Fix handling of faux_infinite values in network_simplex
- Fixed the return type from an empty dict to an empty set
- Add ``edge_attrs="weight"`` to ``forceatlas2_layout`` dispatch decorator
- Fix graph_hash iteration counts and DiGraph handling
- Refactored the working of chordless_cycles to handle self loops
- Fix bc scale with k endpoints
- Fix BC scaling for source nodes with k and endpoints=False
- BUG: graph6 format invariant to trailing newline
- Fix ``random_degree_sequence_graph`` when input is an iterator
- Improve special cases in dispatch testing (paying off tech debt)
- Fix bug when assigning list to ``nx.config.backend_priority``
- A minimal fix for ``is_aperiodic``
- fix bug of _sparse_fruchterman_reingold and remove try/except idiom
- Fix edge case in ISMAGS symmetry detection
Documentation
- set nx-arangodb link to github
- Re-submission of gh-7087 with better file provenance
- Fix code formatting of some examples
- Add examples for custom graph in the doc of ``soft_random_geometric_graph`` \
and ``thresholded_random_geometric_graph``
- Gallery example: bipartite a/b-core motif
- Add blurb about pytest-mpl dependency to contributing guide
- Minor updates to ``single_source_shortest_path_length`` docstring
- Added a note to the contributor guideline to avoid numpy scalars as a…
- Correcting the example given under subgraph_is_monomorphic.py
- [easy] Add to Contributor List
- doc: mention the second major update
- DOC: Add details about more grants
- Refactor: Moving backend docs from ``backends.py`` to ``backends.rst``
- Update readwrite docstrings for the ``path`` parameter
- Fix docstring example of ``nx.generate_random_paths(index_map=...)``
- Adds NVIDIA Corporation to list of supporters
- Fix use of triple backticks in docstrings
- Add paragraph about university classes to mentored projects
- Fix pygraphviz_layout example
- Add test-extras to optional dependencies
- doc: hash size are in bytes
- DOC: Clean up mentored projects page: move visualization project to completed \
section
- added 2 projects for GSoC 2025
- Add missing usebounds param descr to distance docstrings
- Add examples to graph_atlas_g docstring
- Add missing ``weight`` and ``gravity`` attribute to ``forceatlas2_layout`` \
docstring
- DOC: Update first docstring example and add a serialization example
- DOC: Remove myself from the mentor list for projects
- Fix typo in forceatlas2_layout
- Add ``tournament_matrix`` to docs
- Add function descriptions in the threshold.py file
- bugfix: use supergraph to compute superpos in plot_clusters example
- More ``random_paths`` docstring improvements
- Add nx-guides link to navbar without dropdown
- Clarifying backend graph class interface is_directed+is_multigraph
- Fix all sphinx build warnings
- Add a new gallery spring layout
- Add note about cycles in ``maximum_flow()``
- Clarify subgraph node/edge order is not preserved
- Fix typo in ``min_edge_cover`` docstring
Maintenance
-----------
- MAINT: wrapping ``partial`` with ``staticmethod()`` in ``test_link_prediction.py``
- Updating ``pip install``s in benchmarking workflow
- Mv changelist to release deps
- Drop support for Python 3.10
- Update minimum dependencies (SPEC 0)
- Remove print statements and comments from test suite
- Refactor closeness centrality tests
- Add Python fallback to random_k_out_graph + document dependencies
- Fix sphinx warnings from numpydoc parsing
- MAINT: Updating geospatial example to be compatible with ``osmnx=2.0.0``
- Add more tests for ``nx.lowest_common_ancestor``
- Update ``shortest_path`` and ``single_target_shortest_path_length`` for 3.5
- Parametrize edge_subgraph multigraph test
- Add filters for LOBPCG convergence warnings
- MAINT: Close mpl figures in tests to clear up test env
- Update pre-commit linting
- Small dispatching refactor: simple ``__call__`` when no backends
- Benchmarking: graph atlas
- Improve square clustering test derived from Zhang paper (reference 2)
- Fix exception for backend-only functions
- Add a subplot fixture to automate test cleanup
- MAINT: use nx.layout instead of importing layouts
- MAINT: Move stub func in the correct scope for pickle test
- Ensure standard import conventions are used
- Clean up pygrep pre-commit for import convention checks
- Add a few more square clustering test cases
- Don't use ``assert`` when using ``pytest.raises``
- Update doc requirements
- Update developer requirements
- MAINT: Minus not underscore in the dep package name
- Update readwrite docstrings for the ``path`` parameter
- Fix docstring example of ``nx.generate_random_paths(index_map=...)``
- Fix use of triple backticks in docstrings
- Add .mailmap file to consilidate contributors
- TST: Refactor example test case generation functions
- Refactor network_simplex test of faux_infinity
- Change CRLF format of two files
- Fix some typos
- Pre commit hooks to check line endings and trailing whitespace
- MAINT: replace the SHAs for blame and move the changes within pre-commit
- Rm stray instances of sparse matrices from test suite
- Remove unused imports
- Remove unnecessary ``dict(...)`` for SSSP algos that return dicts
- Change function calls to address pandas linting
- Activate pycodestyle in linting pre-commit
- Correct sphinx warnings from doc build
- ``effective_size`` of nodes with only self-loop edges is undefined
- DOC: docstring changes to ``to_dict_of_dicts`` and ``attr_matrix`` and input \
name change in ``min_fill_in_heuristic``
- Update layout.py
- Tree isomorphism input validation
- Tweaks and notes from a dive into backends.py
- MAINT: Follow-up to 7945 - rm helper function
- Some light refactoring to make the tree isomorphism tests more readable
- new try at will_call_mutate_inputs
- MAINT: rm debug print from similarity module
- Improve special cases in dispatch testing (paying off tech debt)
- Remove unused import in convert_matrix.py (networkx.utils.not_implemented_for)
- Use ``-n auto`` from pytest-xdist for dispatch and coverage CI jobs
- Make test file names unique to be threadsafe
- Update pre-commit repos
- Minor follow-up to gh-8002 tests
- Add linting for line length in docstrings and comments
- Add sg_execution_times.rst to gitignore
- Support both pydot v3 and pydot v4
- Update copyright license years
- Fix all sphinx build warnings
- Fix intermittent test failures in expander graph generator tests
- Refactor tree_isomorphism to improve code reuse and readability
- STY: Rm local variable remapping of heappush and heappop
- TST: Minor improvements to layout test suite
- Minor refactor to cleanup/improve matching test suite
|
2025-04-15 18:31:40 by Adam Ciarcinski | Files touched by this commit (58) |  |
Log message:
Fix PLIST after py-setuptools update; bump depends and revision
|
| 2024-11-11 08:29:31 by Thomas Klausner | Files touched by this commit (862) |
Log message:
py-*: remove unused tool dependency
py-setuptools includes the py-wheel functionality nowadays
|
2024-10-24 08:50:47 by Adam Ciarcinski | Files touched by this commit (2) |  |
Log message:
py-networkx: updated to 3.4.2
NetworkX 3.4.2
Bug Fixes
- Fix docstrings of dispatchable functions
- Fix draw_networkx_nodes return type
Documentation
- Add disclaimer about LLM driven PRs
Maintenance
- Fix doc warnings from recently added docs
|
| 2024-10-14 08:46:10 by Thomas Klausner | Files touched by this commit (325) |
Log message:
*: clean-up after python38 removal
|
| 2024-08-06 13:22:30 by Adam Ciarcinski | Files touched by this commit (1) |
Log message:
py-networkx: requires Python 3.10 or newer
|