Skip to content

retworkx 0.7.0
Compare
Choose a tag to compare
@mtreinish mtreinish released this 03 Dec 14:50
0.7.0
This tag was signed with the committer’s verified signature.
mtreinish Matthew Treinish
GPG key ID: FD12A0F214C9E177
Learn about vigilant mode.
d289260
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.

This release includes several new features and bug fixes.

This release also dropped support for Python 3.5. If you want to use
retworkx with Python 3.5 that last version which supports Python 3.5
is 0.6.0.

Added

  • New generator functions for two new generator types, mesh and grid
    were added to retworkx.generators for generating all to all and grid
    graphs respectively. These functions are:
    retworkx.generators.mesh_graph(),
    retworkx.generators.directed_mesh_graph(),
    retworkx.generators.grid_graph(), and
    retworkx.generators.directed_grid_graph()
  • A new function, digraph_union(), for taking the union between two
    PyDiGraph objects has been added.
  • A new PyDiGraph method merge_nodes() has been added. This method can be used
    to merge 2 nodes in a graph if they have the same weight/data payload.
  • A new PyDiGraph method find_node_by_weight() which can be used to lookup
    a node index by a given weight/data payload.
  • A new return type NodeIndices has been added. This class is returned
    by functions and methods that return a list of node indices. It
    implements the Python sequence protocol and can be used as list.
  • Two new return types EdgeList and WeightedEdgeList. These classes are
    returned from functions and methods that return a list of edge tuples
    and a list of edge tuples with weights. They both implement the Python
    sequence protocol and can be used as a list
  • A new function collect_runs() has been added. This function is used to
    find linear paths of nodes that match a given condition.

Upgrade

  • Support for running retworkx on Python 3.5 has been dropped. The last
    release with support for Python 3.5 is 0.6.0.
  • The PyDiGraph.node_indexes(), PyDiGraph.neighbors(),
    PyDiGraph.successor_indices(), PyDiGraph.predecessor_indices(),
    PyDiGraph.add_nodes_from(), PyGraph.node_indexes(),
    PyGraph.add_nodes_from(), and PyGraph.neighbors() methods and the
    dag_longest_path(), topological_sort(),
    graph_astar_shortest_path(), and digraph_astar_shortest_path()
    functions now return a NodeIndices object instead of a list of
    integers. This should not require any changes unless explicit type
    checking for a list was used.
  • The PyDiGraph.edge_list() and PyGraph.edge_list() methods and
    digraph_dfs_edges(), graph_dfs_edges(), and digraph_find_cycle()
    functions now return an EdgeList object instead of a list of integers.
    This should not require any changes unless explicit type checking
    for a list was used.
  • The PyDiGraph.weighted_edge_list(), PyDiGraph.in_edges(),
    PyDiGraph.out_edges(), and PyGraph.weighted_edge_list() methods now
    return a WeightedEdgeList object instead of a list of integers. This
    should not require any changes unless explicit type checking for a
    list was used.

Fixes

  • BFSSuccessors objects now can be compared with == and != to any other
    Python sequence type
  • The built and published sdist packages for retworkx were previously
    not including the Cargo.lock file. This meant that the reproducible
    build versions of the rust dependencies were not passed through to
    source. This has been fixed so building from sdist will always use
    known working versions that we use for testing in CI.
Assets 2
Loading