The NetBSD Project

CVS log for pkgsrc/math/py-networkx/PLIST

[BACK] Up to [cvs.NetBSD.org] / pkgsrc / math / py-networkx

Request diff between arbitrary revisions


Keyword substitution: kv
Default branch: MAIN


Revision 1.26: download - view: text, markup, annotated - select for diffs
Wed Oct 28 13:41:03 2026 UTC (2 weeks, 4 days ago) by adam
Branches: MAIN
CVS tags: HEAD
Diff to: previous 1.25: preferred, colored
Changes since revision 1.25: +10 -1 lines
py-networkx: updated to 3.7

3.7

Highlights
The isomorphism checking suite of tools has been upgraded. The VF2++ functions now provide subgraph isomorphism and subgraph monomorphism checking
Leiden based community detection algorithms are now supported via leiden_communities and leiden_partitions. This provides an alternative, often improved, community detection algorithm compared to the Louvain functions
The pygraphviz library is now provided via pip with wheels that include the GraphViz binaries. This should make the NetworkX interface to pygraphviz easier to use for graph layout and rendering

Revision 1.25: download - view: text, markup, annotated - select for diffs
Mon Dec 15 12:05:15 2025 UTC (11 months ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2026Q3-base, pkgsrc-2026Q3, pkgsrc-2026Q2-base, pkgsrc-2026Q2, pkgsrc-2026Q1-base, pkgsrc-2026Q1, pkgsrc-2025Q4-base, pkgsrc-2025Q4
Diff to: previous 1.24: preferred, colored
Changes since revision 1.24: +25 -7 lines
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

Revision 1.24: download - view: text, markup, annotated - select for diffs
Wed Jun 4 12:32:02 2025 UTC (17 months, 1 week ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2025Q3-base, pkgsrc-2025Q3, pkgsrc-2025Q2-base, pkgsrc-2025Q2
Diff to: previous 1.23: preferred, colored
Changes since revision 1.23: +30 -1 lines
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

Revision 1.23: download - view: text, markup, annotated - select for diffs
Tue Apr 15 16:31:38 2025 UTC (19 months ago) by adam
Branches: MAIN
Diff to: previous 1.22: preferred, colored
Changes since revision 1.22: +2 -2 lines
Fix PLIST after py-setuptools update; bump depends and revision

Revision 1.22: download - view: text, markup, annotated - select for diffs
Mon May 20 10:21:50 2024 UTC (2 years, 5 months ago) by wiz
Branches: MAIN
CVS tags: pkgsrc-2025Q1-base, pkgsrc-2025Q1, pkgsrc-2024Q4-base, pkgsrc-2024Q4, pkgsrc-2024Q3-base, pkgsrc-2024Q3, pkgsrc-2024Q2-base, pkgsrc-2024Q2
Diff to: previous 1.21: preferred, colored
Changes since revision 1.21: +21 -3 lines
py-networkx: update to 3.3.

API Changes
-----------

- Disallow negative number of nodes in ``complete_multipartite_graph``
- DEP: Deprecate the all_triplets one-liner
- [A-star] Added expansion pruning via cutoff if cutoff is provided
- Make HITS raise exceptions consistent with power iterations
- DEP: Deprecate random_triad
- Added feature modular graph product
- ENH: Speed up common/non_neighbors by using _adj dict operations
- Deprecate the ``create`` argument of ``nonisomorphic_trees``
- Improve total_spanning_tree_weight
- Update __init__.py
- add **kwargs to traveling_salesman_problem

Enhancements
------------

- Add Tadpole graph
- [A-star] Added expansion pruning via cutoff if cutoff is provided
- Implementation of $S^1$ model
- [Feat] Random expanders utilities
- Compare graphs for generator functions when running tests with backend
- Add Kirchhoff index / Effective graph resistance
- Changed return types of shortest path methods to improve consistency
- New PR for Fixes minimal d-separator function failing to handle cases where no d-separators exist
- ENH : Provide non-normalized and normalized directed laplacian matrix calculation
- feat: drop the use of node attribute "first_nbr" in PlanarEmbedding
- Add functions to compute Schultz and Gutman Index
- Divisive community algorithms
- Added feature modular graph product
- ENH : added ``sort_neighbors`` to all functions in ``depth_first_search.py``
- New graph generator for the Kneser graph
- Draw MultiDiGraph edges and labels qa7008
- Use github actions to run a comparison benchmark
- BFS layout implementation
- Add ``max_level=`` argument to ``louvain_communities`` to limit macro-iterations
- Review and update ``@nx._dispatchable`` usage since 3.2.1
- Transmogrify ``_dispatchable`` objects into functions
- fix: make ``PlanarEmbedding.copy()`` use ``add_edges_from()`` from parent
- Allow seed of np.random instance to exactly produce arbitrarily large integers
- Improve total_spanning_tree_weight
- add seed to ``nx.generate_random_paths``
- Allow backends to implement ``should_run``
- Adding tree broadcasting algorithm in a new module
- Option to include initial labels in ``weisfeiler_lehman_subgraph_hashes``
- Add better error message when trying to get edge that is not present
- Make ``is_negatively_weighted`` dispatchable
- Add option to hide or show tick labels
- ENH: Cache graphs objects when converting to a backend

Bug Fixes
---------

- Fix listing of release notes on Releases page
- Fix syntax warning from bad escape sequence
- Fix triangles to avoid using ``is`` to compare nodes
- Fix error message for ``nx.mycielski_graph(0)``
- Disallow negative number of nodes in ``complete_multipartite_graph``
- Handle edge cases for greedy_modularity_communities
- FIX: Match the doc description while copying over data
- fix: Include singleton/trivial paths in all_simple_paths & other functions
- Dinitz correction
- Modify GML test to fix invalid octal character warning
- Fix random_spanning_tree() for single node and empty graphs
- PlanarEmbedding.remove_edge() now updates removed edge's neighbors
- add seed to graph creation
- add seed to tests of fast_label_propatation_communities
- Fix rich_club_coefficient() for single node and empty graphs
- Fix minimum_spanning_arborescence regression
- Move arrowstyle input munging after intput validation
- Fix empty GraphML attribute is not parsed
- Add new test result to ``test_asadpour_tsp`` and change ``linprog`` method
- Fix custom weight attribute for Mehlhorn

Documentation
-------------

- Update release process
- Update convert_matrix.py
- fix extendability function name in bipartite.rst
- Minor doc cleanups to remove doc build warnings
- DOC: Add example to generic_bfs_edges to demonstrate the ``neighbors`` param
- Hierarchical clustering layout gallery example
- Fixed an error in the documentation of the katz centrality
- Create 3d_rotation_anime.py
- DOC: Add docstrings to filter view functions
- DOC: Add docstrings to Filter mapping views
- DOCS: Fix internal links to other functions in isomorphvf2
- added note for the triangle inequality case in TSP
- Add note about importance of testing to contributor guide
- Proposal to add centrality overview to mentored projects
- Improve documentation of Component Algorithms
- Add dot io to readwrite
- Add Python versions to release notes
- DOC: Turn on inline plots in graph generators docstrings
- Fix duplicate numbering in contributor guide
- DOC: remove unnecessary 'or' in planted_partition_graph
- DOC: Link methods in functions to base Graph methods/properties
- Connect docs to doc_string for total_spanning_tree_weight
- Image
- update triadic_census documentation for undirected graphs - issue 4386
- added 3d and animation to plot_greedy_coloring.py
- DOC: fix URL econded links and doc references
- DOC: add reference to fast_label_propagation_communities
- updated See also sec of argmap class
- DOC : updated examples in mincost.py
- Document the walk_type argument default in directed_laplacian and similar functions
- DOC: Add plots to classic graph generators docs
- Fix a tiny typo in ``structuralholes.py::local_constraint`` docstring
- Added ``subgraph_is_monomorphic`` and ``subgraph_monomorphisms_iter`` in docs
- Fix online docs for ``_dispatch``
- DOC : Updated docs for panther_similarity
- Fix warnings when building docs
- Improve docs for optimal_edit_paths
- DOC: build with nx-parallel extra documentation information
- Fixed typo in tensor product documentation
- Add example for cycle detection
- Update general_k_edge_subgraphs docstring
- Update docstring of nonisomorphic_trees
- adding self loops related docs and tests for functions in ``cluster.py``
- Add minimum_cycle_basis to cycle_basis See Also
- Update CONTRIBUTING.rst
- Fix all sphinx warnings during doc build
- Doc infrastructure: replace ``nb2plot`` with ``myst-nb``
- Add explicit targets of missing modules for intersphinx
- DOC: add doc suggestions for arbitrarily large random integers tools
- Try/except intermittently failing basemaps in geospatial examples
- Update docstring example with future-proof pandas assignment
- Remove animation from spectral clustering example to improve performance
- Doc Improvements for Approximations Files
- Update ``LCF_graph`` docstring
- Option to include initial labels in ``weisfeiler_lehman_subgraph_hashes``
- Add eriknw as contributor
- [DOC, DISPATCH] : updated and added ``backend.py``'s docs
- add **kwargs to traveling_salesman_problem
- Move the backend docs and connect the config docs. Both in a single sidebar entry

Maintenance
-----------

- Drop Python 3.9 support
- fix: Explicitly check for None/False in edge_attr during import from np
- Add favicon
- Remove unused code resistance_distance
- Fix names of small graphs
- Improve error messages for misconfigured backend treatment
- MAINT: Fixup union exception message
- MAINT: Minor touchups to tadpole and lollipop graph
- Add ``@not_implemented_for("directed")`` to ``number_connected_components``
- remove unused code
- Minor touchups to the beamsearch module
- Fix annoying split strings on same line
- Update dispatch decorator for ``hits`` to use ``"weight"`` edge weight
- Remove nbconvert upper pin
- Add a step to CI to check for warnings at import time
- Added few tests for /generators/duplication.py and /generators/geomet…
- Test on Python 3.13-dev
- Changed arguments list of GraphMLWriterLxml.dump()
- ``write_graphml``: Small fix for object type description on ``TypeError`` exception
- updated functions in ``core.py``
- label check on push and change check name
- DEP : adding ``not_implemented_for("multigraph”)`` to ``k_core``, ``k_shell``, ``k_crust`` and ``k_corona``
- Add label check when pull request is edited instead of push
- Add label workflow pull_request type synchronize and echo message
- adding test coverage for isomorphism when using digraphs
- Remove usage of ``__networkx_plugin__``
- DOC: consistent spelling of neighbor and rename vars
- MAINT: use ruff format instead of black
- Ensure warnings related to changes in shortest_path returns are visible to users
- Sync up behavior of is_{type} for empty graphs
- Added ``NodeNotFound`` exceptions to ``_apply_prediction`` and ``simrank``, and ignored isolated nodes in ``panther_similarity``
- Fix not_implemented_for decorator for is_regular and related functions
- Fix all_node_cuts output for complete graphs
- Remove ``"networkx.plugins"`` and ``"networkx.plugin_info"`` entry-points
- Bump actions/setup-python from 4 to 5
- Update test suite for Pytest v8
- Undeprecate ````nx_pydot```` now that pydot is actively maintained again
- Future-proofing and improve tests
- Drop old dependencies per SPEC 0
- Update pygraphviz
- Refactor geometric_soft_configuration_model tests for performance
- Rename ``_dispatch`` to ``_dispatchable``
- Replace tempfile with tmp_path fixture in test suite
- updated test_directed_edge_swap #5814
- Bump copyright year for 2024
- Improving test coverage for Small.py
- Test for symmetric edge flow betweenness partition
- MAINT : added ``seed`` to ``gnm_random_graph`` in ``community/tests/test_label_propagation.py``
- Bump scientific-python/upload-nightly-action from 0.2.0 to 0.3.0
- adding self loops related docs and tests for functions in ``cluster.py``
- Improving test coverage for Mycielsky.py
- Use ruff's docstring formatting
- Add docstring formatting change to blame-ignore-revs
- Improve test coverage for random_clustered and update function names
- Doc infrastructure: replace ``nb2plot`` with ``myst-nb``
- Temporarily rm geospatial examples to fix CI
- Improve test coverage for bipartite extendability
- CI: Update scientific-python/upload-nightly-action from 0.3.0 to 0.4.0
- CI: Group dependabot updates
- CI: update upload-nightly-action to 0.5.0
- renaming backend ``func_info`` dictionary's keys
- Add ``mutates_input=`` and ``returns_graph=`` to ``_dispatchable``
- Avoid creating results with numpy scalars
- Bump changelist from 0.4 to 0.5
- Improve test coverage for bipartite matrix.py
- Un-dispatch coloring strategies
- Undo change in return type of ``single_target_shortest_path_length``
- Remove animation from spectral clustering example to improve performance
- Expire steinertree mehlhorn futurewarning
- Update louvain test modularity comparison to leq
- Add aaronzo as contributor
- Fix #7339. ``shortest_path`` inconsisitent with warning
- Add ``nx.config`` dict for configuring dispatching and backends
- Improve test coverage for Steiner Tree & Docs
- added ``seed`` to ``test_richclub_normalized``
- Add tests to link_prediction.py
- Fix pydot tests when testing backends
- Future proof xml parsing in graphml
- make doc_string examples order-independent by removing np.set_printoptions
- Close figures on test cleanup
- More numpy scalars cleanup for numpy 2.0
- Update numpydoc
- Fix pygraphviz tests causing segmentation faults in backend test
- Add dispatching to broadcasting.py
- Update test suite to handle when scipy is not installed
- Rm deprecated np.row_stack in favor of vstack
- Fix exception for ``del config[key]``
- Bump the GH actions with 3 updates

Revision 1.21: download - view: text, markup, annotated - select for diffs
Tue Jan 2 00:37:37 2024 UTC (2 years, 10 months ago) by ryoon
Branches: MAIN
CVS tags: pkgsrc-2024Q1-base, pkgsrc-2024Q1
Diff to: previous 1.20: preferred, colored
Changes since revision 1.20: +34 -11 lines
py-networkx: Update to 3.2.1

Changelog:
3.2.1:

Release date: 28 October 2023

Supports Python 3.9, 3.10, 3.11, and 3.12.

NetworkX is a Python package for the creation, manipulation, and study of the
structure, dynamics, and functions of complex networks.

For more information, please visit our website and our gallery of examples.
Please send comments and questions to the networkx-discuss mailing list.

API Changes#

  * Disallow negative number of nodes in complete_multipartite_graph (#7057).

Enhancements#

  * Add Tadpole graph (#6999).

Bug Fixes#

  * Fix listing of release notes on Releases page (#7030).

  * Fix syntax warning from bad escape sequence (#7034).

  * Fix triangles to avoid using is to compare nodes (#7041).

  * Fix error message for nx.mycielski_graph(0) (#7056).

  * Disallow negative number of nodes in complete_multipartite_graph (#7057).

Documentation#

  * Update release process (#7029).

  * fix extendability function name in bipartite.rst (#7042).

  * Minor doc cleanups to remove doc build warnings (#7048).

Maintenance#

  * fix: Explicitly check for None/False in edge_attr during import from np (#
    6825).

  * Add favicon (#7043).

  * Remove unused code resistance_distance (#7053).

  * Fix names of small graphs (#7055).

  * Improve error messages for misconfigured backend treatment (#7062).

Other#

  * Update convert_matrix.py (#7018).


3.2:

Release date: 18 October 2023

Supports Python 3.9, 3.10, 3.11, and 3.12.

NetworkX is a Python package for the creation, manipulation, and study of the
structure, dynamics, and functions of complex networks.

For more information, please visit our website and our gallery of examples.
Please send comments and questions to the networkx-discuss mailing list.

Highlights#

  * Add @nx._dispatch decorator to most algorithms (#6688).

API Changes#

  * Remove topo_order kwarg from is_semiconnected without deprecation (#6651).

  * deprecate Edmonds class (#6785).

  * Make weight part of the API for functions which had default assumptions (#
    6814).

  * ENH: let users set a default value in get_attr methods (#6887).

  * Rename function join as join_trees (#6908).

  * API: Add a decorator to deprecate positional args (#6905).

  * Expire deprecation for attrs kwarg in node_link module (#6939).

  * Minor touchup to the sort_neighbors deprecation (#6942).

  * Rm deprecated create_using kwarg from scale_free_graph (#6940).

  * Make position part of the API for geometric_edges (#6816).

  * Undeprecate literal_(de)stringizer (#6943).

  * Make new dtype param for incidence_matrix kwarg-only (#6954).

  * Make weight and seed for fast_label_propagation_communities kwarg only (#
    6955).

  * API: Rm default value from time_delta for cd_index (#6953).

  * Deprecate strongly_connected_components_recursive (#6957).

  * Rm deprecated clique helper functions (#6941).

Enhancements#

  * Update calculation of triangles (#6258).

  * Add single_source_all_shortest_paths and all_pairs_all_shortest_paths (#
    5959).

  * Add @nx._dispatch decorator to most algorithms (#6688).

  * Move benchmarks inside main repo (#6835).

  * ENH ?? Replaced for-loops in :function:rescale_layout with numpy vectorized
    methods (#6879).

  * Fast label propagation algorithm for community detection (#6843).

  * Add time series Visibility Graph generator (#6880).

  * Random trees & forests (#6758).

  * Add support for tuple-nodes to default gml parser (#6950).

  * Add Kemeny??s constant (#6929).

  * Speedup resistance_distance (#6925).

  * Allow graph generators and conversion functions to be dispatched (#6876).

  * adding extendability problem (2nd try) (#4890).

Bug Fixes#

  * Fixing DOT format for to_agraph() (#6474).

  * Remove topo_order kwarg from is_semiconnected without deprecation (#6651).

  * Stabilize test of approximation.connected_components (#6715).

  * Fix minimum_cycle_basis and change to return cycle instead of set (#6788).

  * Refix minimum_cycle_basis and scipy.sparse conversions and add tests (#6789
    ).

  * number_of_walks might use a weighted edge attribute (#6815).

  * GML: added support for reading multi-line values (#6837).

  * Avoid directed_laplacian_matrix causing nans in some cases (#6866).

  * Add test about zero weight cycles and fix goldberg-radzik (#6892).

  * Modify s_metric normalized default so function doesn??t raise (#6841).

  * Error handling for invalid prufer sequence from_prufer_sequence: issue #
    6420 (#6457).

  * FIX: Better default behaviour for percolation centrality with no node attrs
    (#6894).

  * FIX: MultiDiGraphs keys got lost in weighted shortest paths (#6963).

  * Handle edge cases in Laplacian centrality (#6938).

  * adding a formula that ignores self-loops at the each level of directed
    louvain algorithm (#6630).

  * Fix ````is_k_edge_connected```` for case of k=2 (#7024).

Documentation#

  * Fix links in laplacian_centrality and laplacian_matrix (#6623).

  * Add Greedy Coloring Example to Gallery (#6647).

  * Add linting to contributor guide (#6692).

  * Minor fixups to equitable_coloring docstring (#6673).

  * Remove survey banner (#6818).

  * fix: make messages readable (#6860).

  * add docs for source input of dfs_predecessor and dfs_successor (#6867).

  * Clarify that basis generates simple cycles only (#6882).

  * Revert ??Clarify that basis generates simple cycles only?? (#6885).

  * updating TSP example docs (#6794).

  * MAINT: Point the PR template to pre-commit (#6902).

  * fix doc build errors/warnings (#6907).

  * DOC: stray backtick and double instead of simple backtick (#6917).

  * DOC: Add example for self loop multidigraph in contraction (#6901).

  * Fix sphinx docs rendering of dispatched functions (#6895).

  * added more examples on graphical degree sequence (#5634).

  * Minor touchup to the sort_neighbors deprecation (#6942).

  * Warning comment for float weights in betweenness.py (#5171).

  * DOC: Misc typos (#6959).

  * Fixing typo in effective_size documentation (#6967).

  * fix examples in tournament.py (#6964).

  * Fix a reference (#6977).

  * Add missing parameter to snap_aggregation docstring (#6978).

  * Update developer deprecation todo list (#6985).

  * Add ??networkx.plugin_info?? entry point and update docstring (#6911).

  * document graph type; add links; rm unused import (#6992).

  * Add GraphBLAS backend to online docs (#6998).

  * Add 3.2rc0 release notes (#6997).

  * Update release process for changelist (#7005).

  * Update contributing guide for changelist workflow (#7004).

  * Fix definition of \(m\) parameter in docstring of modularity function (#
    6990).

  * updated docs of SA_tsp and TA_tsp (#7013).

  * Update katz_centrality missing default alpha value (#7015).

Maintenance#

  * Replacing codecov Python CLI with gh action (#6635).

  * Bump pyupgrade minimum Python version to 3.9 (#6634).

  * MAINT: minor coverage cleanup (#6674).

  * Rm unreachable code for validating input (#6675).

  * Pin sphinx<7 as temporary fix for doc CI failures (#6680).

  * Example of improving test granularity related to #5092 (#5094).

  * MAINT: Bump scipy version and take advantage of lazy loading (#6704).

  * Drop support for Python 3.8 per SPEC0 (#6733).

  * Update pygraphviz (#6724).

  * Update core dependencies per SPEC0 (#6734).

  * Test on Python 3.12-beta2 (#6737).

  * update the OSMnx example (#6775).

  * Minor fixups to clear up numpy deprecation warnings (#6776).

  * Add label-check workflow (#6797).

  * Use dependabot (#6799).

  * Bump webfactory/ssh-agent from 0.7.0 to 0.8.0 (#6800).

  * Attach milestone to merged PRs (#6802).

  * Add preserve_all_attrs to convert_from_nx to make it concise (#6812).

  * Bump scientific-python/attach-next-milestone-action from
    f94a5235518d4d34911c41e19d780b8e79d42238 to
    bc07be829f693829263e57d5e8489f4e57d3d420 (#6830).

  * Relax threshold in test of betweenness_centrality (#6827).

  * Add @nx._dispatch to {single_source,all_pairs}_all_shortest_paths, cd_index
    (#6832).

  * ci: Add distribution verification checks to nightly wheel upload (#6831).

  * MAINT: fix link to nightly releases wheels (#6845).

  * Don??t test numpy2 nightlies (#6852).

  * MAINT: replace numpy aliases in scipy namespace (#6857).

  * Unpin scipy upperbound for tests (#6727).

  * Temporary work-around for NEP 51 numpy scalar reprs + NX doctests (#6856).

  * Unpin numpy nightly wheels (#6854).

  * fix: make messages readable (#6860).

  * Revert ??Pin sphinx<7 as temporary fix for doc CI failures (#6680)?? (#6859
    ).

  * Change _dispatch to a class instead of a closure (#6840).

  * Move random_state decorators before @nx._dispatch (#6878).

  * MAINT: Make GEXF and graphml writer work with numpy 2.0 (#6900).

  * Rename function join as join_trees (#6908).

  * add missing join deprecation stuff to release_dev and conftest (#6933).

  * MAINT: move dispatch test workflow as an independent CI job (#6934).

  * MAINT: Use importlib.resources instead of file dunder to access files (#
    6936).

  * DOC, MAINT: Deduplicate docs instructions (#6937).

  * MAINT: Raise clean error with random_triad for graph with <3 nodes (#6962).

  * Update numpydoc (#6773).

  * MAINT: update pre-commit tools deps (#6965).

  * MAINT: Clean up commented out code in triads (#6961).

  * MAINT: Scipy nightly failing with np alias (#6969).

  * Bump actions/checkout from 3 to 4 (#6970).

  * Add for testing new pydata-sphinx-theme PR (#6982).

  * MAINT: Disable building delaunay geospatial example temporarily (#6981).

  * Revert ??MAINT: Disable building delaunay geospatial example temporarily??
    (#6984).

  * Enhancements change default join trees 6947 (#6948).

  * Update sphinx theme (#6930).

  * Generate requirements files from pyproject.toml (#6987).

  * Use trusted publisher (#6988).

  * Prefer ??backend?? instead of ??plugin?? (#6989).

  * CI: Pin scientific-python/upload-nightly-action to 0.2.0 (#6993).

  * Support Python 3.12 (#7009).

  * pip install nx-cugraph from git, not nightly wheels, for docs (#7011).

  * Fix typos (#7012).

Other#

  * Update release process (#6622).

  * Add Lowest Common Ancestor example to Gallery (#6542).

  * Add examples to bipartite centrality.py (#6613).

  * Remove Python 3.8 from CI (#6636).

  * Fix links in eigenvector.py and katz_centrality.py (#6640).

  * Use the correct namespace for girvan_newman examples (#6643).

  * Preserve node order in bipartite_layout (#6644).

  * Make cycle_basis() deterministic (#6654).

  * Added docstrings examples for clique.py (#6576).

  * Fix output of is_chordal for empty graphs (#6563).

  * Allow multiple graphs for @nx._dispatch (#6628).

  * Adding GitHub Links next to Dheeraj??s name in the contributors list (#6670
    ).

  * Adding is_tounament to main namespace (#6498).

  * Use unpacking operator on dicts to prevent constructing intermediate
    objects (#6040).

  * Added tests to test_correlation.py (#6590).

  * Improve test coverage for neighbor_degree.py (#6589).

  * Added docstring examples for nx_pylab.py (#6616).

  * Improve Test Coverage for current_flow_closeness.py (#6677).

  * try adding circleci artifact secret (#6679).

  * Improve test coverage for reaching.py (#6678).

  * added tests to euler.py (#6608).

  * codespell: pre-commit, config, typos fixed (#6662).

  * Improve test coverage for mst.py (#6540).

  * Handle weights as distance= in testing dispatch (#6671).

  * remove survey banner (#6687).

  * CircleCI: add token for image redirector (#6695).

  * MAINT: Add subgraph_view and reverse_view to nx namespace directly through
    graphviews (#6689).

  * Added docstring example for dense.py (#6669).

  * MAINT: Add a github action cron job to upload nightly wheels (#6701).

  * MAINT: fix file path in nightly build workflow (#6702).

  * Add example script for shortest path (#6534).

  * Added doctrings for generic_graph_view (#6697).

  * Doc: wrong underline length (#6708).

  * MAINT: cron job to test against nightly deps every week (#6705).

  * simplify stack in dfs (#6366).

  * optimize generic_bfs_edges function (#6359).

  * Optimize _plain_bfs functions (#6340).

  * Added girth computation function (#6633).

  * MAINT: Stop CI from uploading nightly on forks (#6717).

  * Performance improvement for astar_path (#6723).

  * Skip scipy-1.11.0rc1 due to known issue (#6726).

  * Add an optional argument to the incidence_matrix function to provide ?? (#
    6725).

  * Graph walks implementation by jfinkels & dtekinoglu (#5908).

  * DOCS: Add walks to algorithms.index (#6736).

  * Add note about using latex formatting in docstring in the contributor guide
    (#6535).

  * Fix intersection_all method (#6744).

  * Fix Johnson method for unweighted graphs (#6760).

  * MAINT: Ignore SciPy v1.11 in requirements (#6769).

  * Replace deprecated numpy.alltrue method (#6768).

  * keep out scipy 1.11.1 (#6772).

  * Document additional imports required for building the documentation (#6766
    ).

  * modified max_weight_matching to be non-recursive (#6684).

  * Rewrite NXEP 3 (#6648).

  * Refactor edmonds algorithm (#6743).

  * Docstring improvement for nx_pylab.py (#6602).

  * Use pyproject.toml (#6774).

  * Include missing package_data (#6780).

  * [BUG] Patch doc and functionality for is_minimal_d_separator (#6427).

  * Update to the documentation of eigenvector centrality (#6009).

  * Fix typo in contributing page (#6784).

  * Fix empty graph zero division error for louvain (#6791).

  * Vertical chains for network text (#6759).

  * Time dependent module (#6682).

  * Allow user to opt out of edge attributes in from_numpy_array (#6259).

  * modifies ````bfs_edges```` and adds warning to ````generic_bfs_edges```` (#
    5925).

  * Spelling (#6752).

  * Added test cases for join operation and fixed join operation to handle
    label_attributes (#6503).

  * Remove serialisation artifacts on adjacency_graph (#6041).

  * Patch view signature (#6267).

  * Doc add nongraphical examples 6944 (#6946).

  * feat: docstring examples for algorithms/operators/all.py (#6974).

Revision 1.20: download - view: text, markup, annotated - select for diffs
Tue May 9 08:26:44 2023 UTC (3 years, 6 months ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2023Q4-base, pkgsrc-2023Q4, pkgsrc-2023Q3-base, pkgsrc-2023Q3, pkgsrc-2023Q2-base, pkgsrc-2023Q2
Diff to: previous 1.19: preferred, colored
Changes since revision 1.19: +105 -94 lines
py-networkx: updated to 3.1

NetworkX 3.1

- Minor bug-fixes and speed-ups
- Improvements to plugin based backend infrastructure
- Minor documentation improvements
- Improved test coverage
- Last release supporting Python 3.8
- Stopped building PDF version of docs
- Use Ruff for linting


NetworkX 3.0

- Better syncing between G._succ and G._adj for directed G.
  And slightly better speed from all the core adjacency data structures.
  G.adj is now a cached_property while still having the cache reset when
  G._adj is set to a new dict (which doesn't happen very often).
  Note: We have always assumed that G._succ and G._adj point to the same
  object. But we did not enforce it well. If you have somehow worked
  around our attempts and are relying on these private attributes being
  allowed to be different from each other due to loopholes in our previous
  code, you will have to look for other loopholes in our new code
  (or subclass DiGraph to explicitly allow this).
- If your code sets G._succ or G._adj to new dictionary-like objects, you no longer
  have to set them both. Setting either will ensure the other is set as well.
  And the cached_properties G.adj and G.succ will be rest accordingly too.
- If you use the presence of the attribute `_adj` as a criteria for the object
  being a Graph instance, that code may need updating. The graph classes
  themselves now have an attribute `_adj`. So, it is possible that whatever you
  are checking might be a class rather than an instance. We suggest you check
  for attribute `_adj` to verify it is like a NetworkX graph object or type and
  then `type(obj) is type` to check if it is a class.
- We have added an `experimental plugin feature <https://github.com/networkx/networkx/pull/6000>`_,
  which let users choose alternate backends like GraphBLAS, CuGraph for computation. This is an
  opt-in feature and may change in future releases.
- Improved integration with the general `Scientific Python ecosystem <https://networkx.org/documentation/latest/release/migration_guide_from_2.x_to_3.0.html#improved-integration-with-scientific-python>`_.
- New drawing feature (module and tests) from NetworkX graphs to the TikZ library of TeX/LaTeX.
  The basic interface is ``nx.to_latex(G, pos, **options)`` to construct a string of latex code or
  ``nx.write_latex(G, filename, as_document=True, **options)`` to write the string to a file.
- Added an improved subgraph isomorphism algorithm called VF2++.

Revision 1.19: download - view: text, markup, annotated - select for diffs
Wed Dec 9 16:56:19 2020 UTC (5 years, 11 months ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2023Q1-base, pkgsrc-2023Q1, pkgsrc-2022Q4-base, pkgsrc-2022Q4, pkgsrc-2022Q3-base, pkgsrc-2022Q3, pkgsrc-2022Q2-base, pkgsrc-2022Q2, pkgsrc-2022Q1-base, pkgsrc-2022Q1, pkgsrc-2021Q4-base, pkgsrc-2021Q4, pkgsrc-2021Q3-base, pkgsrc-2021Q3, pkgsrc-2021Q2-base, pkgsrc-2021Q2, pkgsrc-2021Q1-base, pkgsrc-2021Q1, pkgsrc-2020Q4-base, pkgsrc-2020Q4
Diff to: previous 1.18: preferred, colored
Changes since revision 1.18: +64 -1 lines
py-networkx: updated to 2.5

NetworkX 2.5

Highlights
----------
This release is the result of 10 months of work with over 200 commits by
92 contributors. Highlights include:

- Dropped support for Python 3.5.
- add Pathlib support to work with files.
- improve performance.
- Updated docs and tests.
- Removed code designed to work with Python 2.

New Functions:
- lukes_partitioning
- triadic analysis functions
- functions for trophic levels analysis
- d_separated
- is_regular and other regular graph measures
- graph_hash using Weisfeiler Lehman methods
- common_neighbor_centrality (CCPA link prediction)
- max_weight_clique
- path_weight and is_path
- rescale_layout_dict
- junction_tree

New generators:
- paley_graph
- interval_graph

New layouts:
- multipartite_layout

Improvements
------------
- Add governance documents, developer guide and community structures
- Implement explicit deprecation policy.
- Initiate an NX Enhancement Proposal (NXEP) system
- optimize single_source_shortest_path
- improved consistent "weight" specification in shortest_path routines
- Reduce numpy.matrix usage which is discouraged by numpy.
- improved line color
- better search engine treatment of docs
- lattice and grid_graph and grid_2d_graph can use dim=tuple
- fix initializer of kamada_kawai_layout algorithm
- moral and threshold functions now included in namespace and docs
- scale arrows better when drawing
- more uniform creation of random lobster graphs
- allow editing graph during iteration over connected_components
- better column handling in coversion of pandas DataFrame
- allow simrank_similarity with directed graph input
- ensure VoteRank ability is nonnegative
- speedup kernighan_lin_bisection
- speedup negative weight cycle detection
- tree_isomorphism
- rooted_tree_isomorphism
- Gexf edge attribute "label" is available

API Changes
-----------
- enabled "copy" flag parameter in `contracted_nodes`
- allow partially periodic lattices
- return value for minimum_st_node_cut now always a set
- removed unused "has_numpy" argument from create_py_random_state
- fixed return values when drawing empty nodes and edges
- allow sets and frozensets of edges as input to nx.Graph()
- "weight" can be function for astar, directional_dijksta, all_shortest_path
- allow named key ids for GraphML edge writing
- all keywords are now checked for validity in nx.draw and friends
- EdgeDataView "in" operator checks if nodes are "in nbunch"
- remove completeness condition from minimum weight full matching
- option to sort neighbors in bfs traversal
- draw_networkx accepts numpy array for edgelist
- relabel_nodes with 2 nodes mapped to same node can now create multiedge
- steiner_tree works with MultiGraph
- Add `show` kwarg to view_pygraphviz
- Prepare for turning chordal_graph_cliques into a generator
- GraphML reader keyword force_multigraph creates MultiGraph even w/o multiedges

Revision 1.18: download - view: text, markup, annotated - select for diffs
Sat Apr 11 07:45:41 2020 UTC (6 years, 7 months ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2020Q3-base, pkgsrc-2020Q3, pkgsrc-2020Q2-base, pkgsrc-2020Q2
Diff to: previous 1.17: preferred, colored
Changes since revision 1.17: +121 -16 lines
py-networkx: updated to 2.4

2.4:
This release is the result of 6 months of work with over 200 commits by
67 contributors. Highlights include:

- Remove deprecated code from 1.x
- Support for Python 3.8
- Switched to pytest for testing
- Last release to support Python 3.5

New Functions:

- barycenter functions
- Bethe Hessian matrix function
- Eulerian Path methods
- group centrality measures
- subgraph monomorphisms
- k-truss algorithms
- onion decomposition
- resistance distance
- asteroidal triples
- non-randomness measures
- linear prufing
- minimum weight bipartite matching
- Incremental closeness centrality
- ISMAGS subgraph isomorphism algorithm
- create chordal graph of a graph

New generators

- Binomial tree generator
- Directed joint degree generator
- Random internet AS graph generator

New for Layouts

- spiral node layout routine
- support for 3d layouts


Improvements
------------
- allow average shortest path to use Floyd-Warshall method
- improve read/write of GML, GEXF, GraphML
- allow string or json object as input to jit_graph
- attempt to allow numpy.array input in place of lists in more places
- faster strongly connected components
- faster Floyd-Warshall Optimization
- faster global efficiency
- faster transitive closure
- fix unionfind; betweenness_subset; lexico-topo-sort; A*;
  inverse_line_graph; async label propagation; edgelist reading;
  Gomory-Hu flow method; label_propagation; partial_duplication;
  shell_layout with 1 node in shell; from_pandas_edgelist
- Documentation improvement and fixes


API Changes
-----------

A utility function is_list_of_ints became is_bunch_of_ints
and now tests int(item)==item instead of isinstance(_, int)
This allows e.g. floats whose values are integer.

Added utility make_list_of_ints to convert containers of
integer values to lists of integers


Deprecations
------------

Removed functions (marked as deprecated in NetworkX 2.1):

- attracting_component_subgraphs
- connected_component_subgraphs
- weakly_connected_component_subgraphs
- strongly_connected_component_subgraphs
- biconnected_component_subgraphs
- See docs for component functions for how to get subgraphs.

Graph Object methods removed (marked as deprecated 2.1)

- G.add_path
- G.add_cycle
- G.add_star
- G.nodes_with_selfloops
- G.number_of_selfloops
- G.selfloop_edges
- These are now NetworkX functions, e.g. nx.add_star(G, 5)
- G.node   --> use G.nodes
- G.fresh_copy   --> use G.__class__

Remove old names for graphview functions.

- ReverseView
- SubGraph
- SubMultiGraph
- SubMultiDiGraph
- SubDiGraph
- GraphView
- DiGraphView
- MultiGraphView
- MultiDiGraphView
- MultiReverseView
- Use reverse_view, subgraph_view and generic_graph_view.

Revision 1.17: download - view: text, markup, annotated - select for diffs
Mon Jun 17 14:58:26 2019 UTC (7 years, 5 months ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2020Q1-base, pkgsrc-2020Q1, pkgsrc-2019Q4-base, pkgsrc-2019Q4, pkgsrc-2019Q3-base, pkgsrc-2019Q3, pkgsrc-2019Q2-base, pkgsrc-2019Q2
Diff to: previous 1.16: preferred, colored
Changes since revision 1.16: +31 -1 lines
py-networkx: updated to 2.3

Announcement: NetworkX 2.3
==========================
We're happy to announce the release of NetworkX 2.3!
NetworkX is a Python package for the creation, manipulation, and study of the
structure, dynamics, and functions of complex networks.

For more information, please visit our website <http://networkx.github.io/>_
and our gallery of examples
<https://networkx.github.io/documentation/latest/auto_examples/index.html>_.
Please send comments and questions to the networkx-discuss mailing list
<http://groups.google.com/group/networkx-discuss>_.

Highlights
----------
This release is the result of 6 months of work with over 92 pull requests by
30 contributors. Highlights include:

- Dropped support for Python 2. We are no longer supporting Python 2.7 and we will
  start changing code to take advantage of Python 3 features we couldn't before.
- Added some Moral Graph analysis functions.
- Enable matplotlib drawing using curved arrows via connectionstyle parameter.
- Remove ticks and axes labels from matplotlib plots.
- Two new generators of Harary Graphs.
- Added Dual Barabasi-Albert model
- Added VoteRank algorithm
- Added Equitable coloring algorithms
- Added planar layout algorithms
- Les Miserables network example
- Javascript example update

Improvements
------------
- Change default colors to be color-blind friendly
- Many bug fixes and documentation improvements
- Speed up of simple_cycles
- Improvements for reading various formats like GML, GEXF, Graphml
- Allow subclassing to access node_attr_dict_factory


API Changes
-----------
- The G.fresh_copy() mechanism for creating an empty_graph of the same
  type (introduced in v2.0) does not playing nicely with pickle and others.
  So, we have removed the code that caused a need for that. Instead you
  should use the more natural G.__class__() syntax to get an empty_graph
  of the same type as G.

Deprecations
------------
- The Graph.fresh_copy() method should now use Graph.__class__()
- ReverseView class removed in favor of reverse_view() function.

Revision 1.16: download - view: text, markup, annotated - select for diffs
Fri Nov 30 10:37:07 2018 UTC (7 years, 11 months ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2019Q1-base, pkgsrc-2019Q1, pkgsrc-2018Q4-base, pkgsrc-2018Q4
Diff to: previous 1.15: preferred, colored
Changes since revision 1.15: +88 -66 lines
py-networkx: updated to 2.2

2.2:
This release is the result of 8 months of work with over 149 commits by
58 contributors. Highlights include:
- Add support for Python 3.7. This is the last release to support Python 2.
- Uniform random number generator (RNG) handling which defaults to global
  RNGs but allows specification of a single RNG for all random numbers in NX.
- Improved GraphViews to ease subclassing and remove cyclic references
  which caused trouble with deepcopy and pickle.
- New Graph method `G.update(H)`

Revision 1.15: download - view: text, markup, annotated - select for diffs
Thu Feb 1 21:00:25 2018 UTC (8 years, 9 months ago) by adam
Branches: MAIN
CVS tags: pkgsrc-2018Q3-base, pkgsrc-2018Q3, pkgsrc-2018Q2-base, pkgsrc-2018Q2, pkgsrc-2018Q1-base, pkgsrc-2018Q1
Diff to: previous 1.14: preferred, colored
Changes since revision 1.14: +45 -13 lines
py-networkx: updated to 2.1

NetworkX 2.1

Highlights
This release is the result of four months of work with 75 pull requests by
37 contributors. Highlights include:

  - Arrows for drawing DiGraph edges are vastly improved!
    And an example to show them.

  - More than 12 new functions for graph generation, manipulation and/or
    new graph algorithms.

    - Add a large clique size heuristic function
    - Add rooted product function
    - Label Propagation Community Detection
    - Minimum cycle basis
    - Add Mycielski Operator
    - Adds prefix_tree, dag_to_branching, and example.
    - Add inverse_line_graph generator
    - Steiner tree and metric closure.
    - Add flow based node and edge disjoint paths.
    - Update geometric networks with new models
    - Graph edit distance
    - Added function for finding a k-edge-augmentation

  - G.name is no longer processed by graph operators. It remains as a
    property mechanism to access ``G.graph['name']`` but the user is in
    charge of updating or changing it for copies, subgraphs, unions and
    other graph operations.

Improvements
  - Many bug fixes, documentation changes.
  - Speed improvements especially for subgraphs.
  - Changed input variable names for functions using ``**kwds``
    to avoid name collisions -- especially ``add_node``
  - New examples for arrows and spectral embedding of the grid graph.

Revision 1.14: download - view: text, markup, annotated - select for diffs
Wed Nov 15 23:22:28 2017 UTC (9 years ago) by markd
Branches: MAIN
CVS tags: pkgsrc-2017Q4-base, pkgsrc-2017Q4
Diff to: previous 1.13: preferred, colored
Changes since revision 1.13: +58 -58 lines
math/py-networkx: prefix doc directory with python version

so package doesn't conflict with other versions of itself.
Bump PKGREVISION

Revision 1.13: download - view: text, markup, annotated - select for diffs
Wed Sep 27 13:25:54 2017 UTC (9 years, 1 month ago) by adam
Branches: MAIN
Diff to: previous 1.12: preferred, colored
Changes since revision 1.12: +308 -87 lines
py-networkx: update to 2.0

NetworkX 2.0
Support for Python 3.6 added, drop support for Python 3.3.

Revision 1.12: download - view: text, markup, annotated - select for diffs
Fri Aug 12 13:38:22 2016 UTC (10 years, 3 months ago) by wen
Branches: MAIN
CVS tags: pkgsrc-2017Q3-base, pkgsrc-2017Q3, pkgsrc-2017Q2-base, pkgsrc-2017Q2, pkgsrc-2017Q1-base, pkgsrc-2017Q1, pkgsrc-2016Q4-base, pkgsrc-2016Q4, pkgsrc-2016Q3-base, pkgsrc-2016Q3
Diff to: previous 1.11: preferred, colored
Changes since revision 1.11: +7 -6 lines
Update to 1.11
Update DEPENDS
Based on PR/51271 from kamelderouiche@yahoo.com

Upstream changes:
1.11

API changes

    [#1930] No longer import nx_agraph and nx_pydot into the top-level namespace. They can be accessed within networkx as e.g. nx.nx_agraph.write_dot or imported as from networkx.drawing.nx_agraph import write_dot.
    [#1750] Arguments center and scale are now available for all layout functions. The defaul values revert to the v1.9 values (center is the origin for circular layouts and domain is [0, scale) for others.
    [#1924] Replace pydot with pydotplus for drawing with the pydot interface.
    [#1888] Replace support for Python3.2 with support for Python 3.5.

Miscellaneous changes

    [#1763] Set up appveyor to automatically test installation on Windows machines. Remove symbolic links in examples to help such istallation.

Change many doc_string typos to allow sphinx to build the docs without errors or warnings.

Enable the docs to be automatically built on readthedocs.org by changing requirements.txt

Revision 1.11: download - view: text, markup, annotated - select for diffs
Sun Nov 1 09:58:28 2015 UTC (11 years ago) by wiz
Branches: MAIN
CVS tags: pkgsrc-2016Q2-base, pkgsrc-2016Q2, pkgsrc-2016Q1-base, pkgsrc-2016Q1, pkgsrc-2015Q4-base, pkgsrc-2015Q4
Diff to: previous 1.10: preferred, colored
Changes since revision 1.10: +148 -17 lines
Update py-networkx to 1.10, based on PR 50383 by Derouiche.

API changes

    [#1501] connected_components, weakly_connected_components, and strongly_connected_components return now a generator of sets of nodes. Previously the generator was of lists of nodes. This PR also refactored the connected_components and weakly_connected_components implementations making them faster, especially for large graphs.
    [#1547] The func_iter functions in Di/Multi/Graphs classes are slated for removal in NetworkX 2.0 release. func will behave like func_iter and return an iterator instead of list. These functions are deprecated in NetworkX 1.10 release.

New functionalities

    [#823] A enumerate_all_cliques function is added in the clique package (networkx.algorithms.clique) for enumerating all cliques (including nonmaximal ones) of undirected graphs.
    [#1105] A coloring package (networkx.algorithms.coloring) is created for graph coloring algorithms. Initially, a greedy_color function is provided for coloring graphs using various greedy heuristics.
    [#1193] A new generator edge_dfs, added to networkx.algorithms.traversal, implements a depth-first traversal of the edges in a graph. This complements functionality provided by a depth-first traversal of the nodes in a graph. For multigraphs, it allows the user to know precisely which edges were followed in a traversal. All NetworkX graph types are supported. A traversal can also reverse edge orientations or ignore them.
    [#1194] A find_cycle function is added to the networkx.algorithms.cycles package to find a cycle in a graph. Edge orientations can be optionally reversed or ignored.
    [#1210] Add a random generator for the duplication-divergence model.
    [#1241] A new networkx.algorithms.dominance package is added for dominance/dominator algorithms on directed graphs. It contains a immediate_dominators function for computing immediate dominators/dominator trees and a dominance_frontiers function for computing dominance frontiers.
    [#1269] The GML reader/parser and writer/generator are rewritten to remove the dependence on pyparsing and enable handling of arbitrary graph data.
    [#1280] The network simplex method in the networkx.algorithms.flow package is rewritten to improve its performance and support multi- and disconnected networks. For some cases, the new implementation is two or three orders of magnitude faster than the old implementation.
    [#1286] Added the Margulis–Gabber–Galil graph to networkx.generators.
    [#1306] Added the chordal p-cycle graph, a mildly explicit algebraic construction of a family of 3-regular expander graphs. Also, moves both the existing expander graph generator function (for the Margulis-Gabber-Galil expander) and the new chordal cycle graph function to a new module, networkx.generators.expanders.
    [#1314] Allow overwriting of base class dict with dict-like: OrderedGraph, ThinGraph, LogGraph, etc.
    [#1321] Added to_pandas_dataframe and from_pandas_dataframe.
    [#1322] Added the Hopcroft–Karp algorithm for finding a maximum cardinality matching in bipartite graphs.
    [#1336] Expanded data keyword in G.edges and added default keyword.
    [#1338] Added support for finding optimum branchings and arborescences.
    [#1340] Added a from_pandas_dataframe function that accepts Pandas DataFrames and returns a new graph object. At a minimum, the DataFrame must have two columns, which define the nodes that make up an edge. However, the function can also process an arbitrary number of additional columns as edge attributes, such as ‘weight’.
    [#1354] Expanded layout functions to add flexibility for drawing subsets of nodes with distinct layouts and for centering each layout around given coordinates.
    [#1356] Added ordered variants of default graph class.
    [#1360] Added harmonic centrality to network.algorithms.centrality.
    [#1390] The generators.bipartite have been moved to algorithms.bipartite.generators. The functions are not imported in the main namespace, so to use it, the bipartite package has to be imported.
    [#1391] Added Kanevsky’s algorithm for finding all minimum-size separating node sets in an undirected graph. It is implemented as a generator of node cut sets.
    [#1399] Added power function for simple graphs
    [#1405] Added fast approximation for node connectivity based on White and Newman’s approximation algorithm for finding node independent paths between two nodes.
    [#1413] Added transitive closure and antichains function for directed acyclic graphs in algorithms.dag. The antichains function was contributed by Peter Jipsen and Franco Saliola and originally developed for the SAGE project.
    [#1425] Added generator function for the complete multipartite graph.
    [#1427] Added nonisomorphic trees generator.
    [#1436] Added a generator function for circulant graphs to the networkx.generators.classic module.
    [#1437] Added function for computing quotient graphs; also created a new module, networkx.algorithms.minors.
    [#1438] Added longest_path and longest_path_length for DAG.
    [#1439] Added node and edge contraction functions to networkx.algorithms.minors.
    [#1445] Added a new modularity matrix module to networkx.linalg, and associated spectrum functions to the networkx.linalg.spectrum module.
    [#1447] Added function to generate all simple paths starting with the shortest ones based on Yen’s algorithm for finding k shortest paths at algorithms.simple_paths.
    [#1455] Added the directed modularity matrix to the networkx.linalg.modularity_matrix module.
    [#1474] Adds triadic_census function; also creates a new module, networkx.algorithms.triads.
    [#1476] Adds functions for testing if a graph has weighted or negatively weighted edges. Also adds a function for testing if a graph is empty. These are is_weighted, is_negatively_weighted, and is_empty.
    [#1481] Added Johnson’s algorithm; one more algorithm for shortest paths. It solves all pairs shortest path problem. This is johnson at algorithms.shortest_paths
    [#1414] Added Moody and White algorithm for identifying k_components in a graph, which is based on Kanevsky’s algorithm for finding all minimum-size node cut-sets (implemented in all_node_cuts #1391).
    [#1415] Added fast approximation for k_components to the networkx.approximation package. This is based on White and Newman approximation algorithm for finding node independent paths between two nodes (see #1405).

Removed functionalities

    [#1236] The legacy ford_fulkerson maximum flow function is removed. Use edmonds_karp instead.

Miscellaneous changes

    [#1192] Support for Python 2.6 is dropped.

Revision 1.10: download - view: text, markup, annotated - select for diffs
Mon Jul 28 12:16:23 2014 UTC (12 years, 3 months ago) by wen
Branches: MAIN
CVS tags: pkgsrc-2015Q3-base, pkgsrc-2015Q3, pkgsrc-2015Q2-base, pkgsrc-2015Q2, pkgsrc-2015Q1-base, pkgsrc-2015Q1, pkgsrc-2014Q4-base, pkgsrc-2014Q4, pkgsrc-2014Q3-base, pkgsrc-2014Q3
Diff to: previous 1.9: preferred, colored
Changes since revision 1.9: +118 -22 lines
Update to 1.9
Add missing DEPENDS

Upstream changes:
NetworkX 1.9
Release date: 21 June 2014

Support for Python 3.1 is dropped in this release.

Highlights
Completely rewritten maximum flow and flow-based connectivity algorithms with backwards incompatible interfaces
Community graph generators
Stoer-Wagner minimum cut algorithm
Linear-time Eulerian circuit algorithm
Linear algebra package changed to use SciPy sparse matrices
Algebraic connectivity, Fiedler vector, spectral ordering algorithms
Link prediction algorithms
Goldberg-Radzik shortest path algorithm
Semiconnected graph and tree recognition algorithms

Revision 1.9: download - view: text, markup, annotated - select for diffs
Tue Jun 10 12:04:58 2014 UTC (12 years, 5 months ago) by wen
Branches: MAIN
CVS tags: pkgsrc-2014Q2-base, pkgsrc-2014Q2
Diff to: previous 1.8: preferred, colored
Changes since revision 1.8: +30 -9 lines
Update to 1.8.1

Upstream changes:
Networkx-1.8.1
Release date: 4 August 2013

Bugfix release for missing files in source packaging

Networkx-1.8
Release date: 28 July 2013

Highlights
Faster (linear-time) graphicality tests and Havel-Hakimi graph generators
Directed Laplacian matrix generator
Katz centrality algorithm
Functions to generate all simple paths
Improved shapefile reader
More flexible weighted projection of bipartite graphs
Faster topological sort, decendents and ancestors of DAGs
Scaling parameter for force-directed layout
Bug Fixes
Error with average weighted connectivity for digraphs, correct normalized laplacian with self-loops, load betweenness for single node graphs, isolated nodes missing from dfs/bfs trees, normalize HITS using l1, handle density of graphs with self loops
Cleaner handling of current figure status with Matplotlib, Pajek files now don't write troublesome header line, default alpha value for GEXF files, read curved edges from yEd GraphML

Revision 1.8: download - view: text, markup, annotated - select for diffs
Fri Jul 13 14:00:32 2012 UTC (14 years, 4 months ago) by wen
Branches: MAIN
CVS tags: pkgsrc-2014Q1-base, pkgsrc-2014Q1, pkgsrc-2013Q4-base, pkgsrc-2013Q4, pkgsrc-2013Q3-base, pkgsrc-2013Q3, pkgsrc-2013Q2-base, pkgsrc-2013Q2, pkgsrc-2013Q1-base, pkgsrc-2013Q1, pkgsrc-2012Q4-base, pkgsrc-2012Q4, pkgsrc-2012Q3-base, pkgsrc-2012Q3
Diff to: previous 1.7: preferred, colored
Changes since revision 1.7: +90 -12 lines
Update to 1.7

Release Log
Networkx-1.7
Release date: 4 July 2012

Highlights
New functions for k-clique community finding, flow hierarchy, union, disjoint union, compose, and intersection operators that work on lists of graphs, and creating the biadjacency matrix of a bipartite graph.
New approximation algorithms for dominating set, edge dominating set, independent set, max clique, and min-weighted vertex cover.
Many bug fixes and other improvements.
For full details of the tickets closed for this release (added features and bug fixes) see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.7

API Changes
See Version 1.7 notes and API changes

Revision 1.7: download - view: text, markup, annotated - select for diffs
Sat Jun 2 13:19:17 2012 UTC (14 years, 5 months ago) by obache
Branches: MAIN
CVS tags: pkgsrc-2012Q2-base, pkgsrc-2012Q2
Diff to: previous 1.6: preferred, colored
Changes since revision 1.6: +381 -28 lines
Update py-networkx to 1.6.
Based on PR 46506 by Wen Heping.
* let to register egg-info.
* marked as incompatible with python 2.5, as new features in 1.3.
  but not marked as compatible with 3.x, one file will not be compiled well
  both 3.1 and 3.2.

Lease Log:

Networkx-1.6

Release date: 20 November 2011

Highlights

New functions for finding articulation points, generating random bipartite
graphs, constructing adjacency matrix representations, forming graph products,
computing assortativity coefficients, measuring subgraph centrality and
communicability, finding k-clique communities, and writing JSON format output.

New examples for drawing with D3 Javascript library, and ordering matrices with
the Cuthill-McKee algorithm.

More memory efficient implementation of current-flow betweenness and new
approximation algorithms for current-flow betweenness and shortest-path
betweenness.

Simplified handling of "weight" attributes for algorithms that use
weights/costs/values. See Version 1.6 notes and API changes.

Updated all code to work with the PyPy Python implementation http://pypy.org
which produces faster performance on many algorithms.

For full details of the tickets closed for this release (added features and bug
fixes) see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.6

API Changes

See Version 1.6 notes and API changes:
	http://networkx.lanl.gov/reference/api_1.6.html

Networkx-1.5

Release date: 4 June 2011

For full details of the tickets closed for this release see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.5

Highlights

New features

	* Algorithms for generating and analyzing bipartite graphs
	* Maximal independent set algorithm
	* Erd?s-Gallai graphical degree sequence test
	* Negative edge cycle test
	* More memory efficient Dijkstra path length with cutoff parameter
	* Weighted clustering coefficient
	* Read and write version 1.2 of GEXF reader format
	* Neighbor degree correlation that handle subsets of nodes
	* In-place node relabeling
	* Many `weighted' graph algorithms now take optional parameter to use
	  specified edge attribute (default=`weight') (ticket 509)
	* Test for distance regular graphs
	* Fast directed Erd?s-Renyi graph generator
	* Fast expected degree graph generator
	* Navigable small world generator
	* Waxman model generator
	* Geographical threshold graph generator
	* Karate Club, Florentine Families, and Davis' Women's Club graphs

API Changes
See Version 1.5 notes and API changes
	http://networkx.lanl.gov/reference/api_1.5.html

Bug fixes
	* Fix edge handling for multigraphs in networkx/graphviz interface
	  (ticket 507)
	* Update networkx/pydot interface for new versions of pydot
	  (ticket 506), (ticket 535)
	* Fix negative cycle handling in Bellman-Ford (ticket 502)
	* Write more attributes with GraphML and GML formats (ticket 480)
	* Handle white space better in read_edgelist (ticket 513)
	* Better parsing of Pajek format files (ticket 524) (ticket 542)
	* Isolates functions work with directed graphs (ticket 526)
	* Faster conversion to numpy matrices (ticket 529)
	* Add graph[`name'] and use properties to access Graph.name (ticket 544)
	* Topological sort confused None and 0 (ticket 546)
	* GEXF writer mishandled weight=0 (ticket 550)
	* Speedup in SciPy version of PageRank (ticket 554)
	* Numpy PageRank node order incorrect + speedups (ticket 555)

Networkx-1.4

Release date: 23 January 2011

New features
	* k-shell,k-crust,k-corona
	* read GraphML files from yEd
	* read/write GEXF format files
	* find cycles in a directed graph
	* DFS and BFS algorithms
	* chordal graph functions
	* Prim's algorithm for minimum spanning tree
	* r-ary tree generator
	* rich club coefficient
	* NumPy matrix version of Floyd's algorithm for all-pairs shortest path
	* read GIS shapefiles
	* functions to get and set node and edge attributes
	* and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4

API Changes
	* gnp_random_graph() now takes a directed=True|False keyword instead of
	  create_using
	* gnm_random_graph() now takes a directed=True|False keyword instead of
	  create_using

Bug fixes
	* see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4

Networkx-1.3

Release date: 28 August 2010

See: https://networkx.lanl.gov/trac/timeline

New features
	* Works with Python versions 2.6, 2.7, 3.1, and 3.2 (but not 2.4 and 2.5).
	* Minimum cost flow algorithms
	* Bellman-Ford shortest paths
	* GraphML reader and writer
	* More exception/error types
	* Updated many tests to unittest style. Run with:
	  "import networkx; networkx.test()" (requires nose testing package)
	* and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3

API Changes
	* minimum_spanning_tree() now returns a NetworkX Graph (a tree or forest)

Bug fixes
	* see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3

Revision 1.6: download - view: text, markup, annotated - select for diffs
Fri Aug 27 03:09:18 2010 UTC (16 years, 2 months ago) by gls
Branches: MAIN
CVS tags: pkgsrc-2012Q1-base, pkgsrc-2012Q1, pkgsrc-2011Q4-base, pkgsrc-2011Q4, pkgsrc-2011Q3-base, pkgsrc-2011Q3, pkgsrc-2011Q2-base, pkgsrc-2011Q2, pkgsrc-2011Q1-base, pkgsrc-2011Q1, pkgsrc-2010Q4-base, pkgsrc-2010Q4, pkgsrc-2010Q3-base, pkgsrc-2010Q3
Diff to: previous 1.5: preferred, colored
Changes since revision 1.5: +279 -67 lines
Update math/py-networkx to 1.2.
From PR pkg/43790 by Kamel Derouiche

pkgsrc changes:
- re-set LICENSE (modified-bsd).

upstream changes:

Networkx-1.2

Release date: 28 July 2010

See: https://networkx.lanl.gov/trac/timeline
New features

        * Ford-Fulkerson max flow and min cut
        * Closness vitality
        * Eulerian circuits
        * Functions for isolates
        * Simpler s_max generator
        * Compatible with IronPython-2.6
        * Improved testing functionality: import networkx; networkx.test() tests
 entire package and skips tests with missing optional packages
        * All tests work with Python-2.4
        * and more, see
https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.2

Networkx-1.1

Release date: 21 April 2010

See: https://networkx.lanl.gov/trac/timeline
New features

        * Algorithm for finding a basis for graph cycles
        * Blockmodeling
        * Assortativity and mixing matrices
        * in-degree and out-degree centrality
        * Attracting components and condensation.
        * Weakly connected components
        * Simpler interface to shortest path algorithms
        * Edgelist format to read and write data with attributes
        * Attribute matrices
        * GML reader for nested attributes
        * Current-flow (random walk) betweenness and closeness.
        * Directed configuration model, and directed random graph model.
        * Improved documentation of drawing, shortest paths, and other
 algorithms
        * Many more tests, can be run with ?import networkx; networkx.test()?
        * and much more, see
https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.1

API Changes
Returning dictionaries

Several of the algorithms and the degree() method now return dictionaries keyed
by node instead of lists. In some cases there was a with_labels keyword which is
no longer necessary. For example,

>>> G=nx.Graph()
>>> G.add_edge('a','b')
>>> G.degree() # returns dictionary of degree keyed by node
{'a': 1, 'b': 1}

Asking for the degree of a single node still returns a single number

>>> G.degree('a')
1

The following now return dictionaries by default (instead of lists) and the
with_labels keyword has been removed:

        * Graph.degree(), MultiGraph.degree(), DiGraph.degree(),
DiGraph.in_degree(), DiGraph.out_degree(), MultiDiGraph.degree(),
MultiDiGraph.in_degree(), MultiDiGraph.out_degree().
        * clustering(), triangles()
        * node_clique_number(), number_of_cliques(), cliques_containing_node()
        * eccentricity()

The following now return dictionaries by default (instead of lists)

        * pagerank()
        * hits()

Adding nodes

add_nodes_from now accepts (node,attrdict) two-tuples

>>> G=nx.Graph()
>>> G.add_nodes_from([(1,{'color':'red'})])

Examples

        * Mayvi2 drawing
        * Blockmodel
        * Sampson?s monastery
        * Ego graph

Bug fixes

        * Support graph attributes with union, intersection, and other graph
operations
        * Improve subgraph speed (and related algorithms such as
connected_components_subgraphs())
        * Handle multigraphs in more operators (e.g. union)
        * Handle double-quoted labels with pydot
        * Normalize betweeness_centrality for undirected graphs correctly
        * Normalize eigenvector_centrality by l2 norm
        * read_gml() now returns multigraphs

Revision 1.5: download - view: text, markup, annotated - select for diffs
Wed Mar 3 12:00:59 2010 UTC (16 years, 8 months ago) by obache
Branches: MAIN
CVS tags: pkgsrc-2010Q2-base, pkgsrc-2010Q2, pkgsrc-2010Q1-base, pkgsrc-2010Q1
Diff to: previous 1.4: preferred, colored
Changes since revision 1.4: +192 -185 lines
Update py-networkx to 1.0.1.
Based on PR#42834 by Wen Heping.
Update MASTER_SITES, set LICENSE=modified-bsd, 3-caulse BSD.

======================================================================
Networkx-1.0.1

Release date: 11 Jan 2010

See: https://networkx.lanl.gov/trac/timeline

Bug fix release for missing setup.py in manifest.

======================================================================
Networkx-1.0

Release date: 8 Jan 2010

See: https://networkx.lanl.gov/trac/timeline
New features

This release has sigificant changes to parts of the graph API to allow graph, node, and edge attributes. See http://networkx.lanl.gov//reference/api_changes.html

        * Update Graph, DiGraph, and MultiGraph classes to allow attributes.
        * Default edge data is now an empty dictionary (was the integer 1)
        * Difference and intersection operators
        * Average shortest path
        * A* (A-Star) algorithm
        * PageRank, HITS, and eigenvector centrality
        * Read Pajek files
        * Line graphs
        * Minimum spanning tree (Kruskal¡Çs algorithm)
        * Dense and sparse Fruchterman-Reingold layout
        * Random clustered graph generator
        * Directed scale-free graph generator
        * Faster random regular graph generator
        * Improved edge color and label drawing with Matplotlib
        * and much more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.0

Examples

        * Update to work with networkx-1.0 API
        * Graph subclass example

======================================================================
Networkx-0.99

Release date: 18 November 2008

See: https://networkx.lanl.gov/trac/timeline
New features¢ù

This release has sigificant changes to parts of the graph API. See http://networkx.lanl.gov//reference/api_changes.html

        * Update Graph and DiGraph classes to use weighted graphs as default Change in API for performance and code simplicity.
        * New MultiGraph and MultiDiGraph classes (replace XGraph and XDiGraph)
        * Update to use Sphinx documentation system http://networkx.lanl.gov/
        * Developer site at https://networkx.lanl.gov/trac/
        * Experimental LabeledGraph and LabeledDiGraph
        * Moved package and file layout to subdirectories.

Bug fixes

        * handle root= option to draw_graphviz correctly

Examples

        * Update to work with networkx-0.99 API
        * Drawing examples now use matplotlib.pyplot interface
        * Improved drawings in many examples
        * New examples - see http://networkx.lanl.gov/examples/

Revision 1.4: download - view: text, markup, annotated - select for diffs
Sun Jun 14 20:47:53 2009 UTC (17 years, 5 months ago) by joerg
Branches: MAIN
CVS tags: pkgsrc-2009Q4-base, pkgsrc-2009Q4, pkgsrc-2009Q3-base, pkgsrc-2009Q3, pkgsrc-2009Q2-base, pkgsrc-2009Q2
Diff to: previous 1.3: preferred, colored
Changes since revision 1.3: +2 -2 lines
Convert @exec/@unexec to @pkgdir or drop it.

Revision 1.3: download - view: text, markup, annotated - select for diffs
Sun Jun 14 18:05:47 2009 UTC (17 years, 5 months ago) by joerg
Branches: MAIN
Diff to: previous 1.2: preferred, colored
Changes since revision 1.2: +1 -13 lines
Remove @dirrm entries from PLISTs

Revision 1.1.8.1: download - view: text, markup, annotated - select for diffs
Fri May 15 12:13:01 2009 UTC (17 years, 6 months ago) by tron
Branches: pkgsrc-2009Q1
Diff to: previous 1.1: preferred, colored; next MAIN 1.2: preferred, colored
Changes since revision 1.1: +5 -0 lines
Pullup ticket #2766 - requested by he
py-networkx: package list fix

Revisions pulled up:
- math/py-networkx/Makefile			1.3
- math/py-networkx/PLIST			1.2
---
Module Name:	pkgsrc
Committed By:	he
Date:		Thu May 14 13:22:34 UTC 2009

Modified Files:
	pkgsrc/math/py-networkx: Makefile PLIST

Log Message:
Update from version 0.37 to 0.37nb1.

Pkgsrc changes:
 o Change from using extension.mk to egg.mk, on hints from wiz@
 o Adjust PLIST so that it matches what is then installed.
 o Bump PKGREVISION

Revision 1.2: download - view: text, markup, annotated - select for diffs
Thu May 14 13:22:34 2009 UTC (17 years, 6 months ago) by he
Branches: MAIN
Diff to: previous 1.1: preferred, colored
Changes since revision 1.1: +6 -1 lines
Update from version 0.37 to 0.37nb1.

Pkgsrc changes:
 o Change from using extension.mk to egg.mk, on hints from wiz@
 o Adjust PLIST so that it matches what is then installed.
 o Bump PKGREVISION

Revision 1.1: download - view: text, markup, annotated - select for diffs
Wed Aug 27 18:53:42 2008 UTC (18 years, 2 months ago) by apb
Branches: MAIN
CVS tags: pkgsrc-2009Q1-base, pkgsrc-2008Q4-base, pkgsrc-2008Q4, pkgsrc-2008Q3-base, pkgsrc-2008Q3, cube-native-xorg-base, cube-native-xorg
Branch point for: pkgsrc-2009Q1
Add math/py-networkx package.

Diff request

This form allows you to request diffs between any two revisions of a file. You may select a symbolic revision name using the selection box or you may type in a numeric name using the type-in text box.

Log view options

CVSweb <webmaster@jp.NetBSD.org>