Recent Releases of https://github.com/cqcl/portgraph

https://github.com/cqcl/portgraph - v0.15.1

Bug Fixes

  • Serialise/Deserialise for indices is backwards compatible (#234)

- Rust
Published by hugrbot 11 months ago

https://github.com/cqcl/portgraph - v0.15.0

New Features

  • added DynamicTopoConvexChecker (#212)
  • [breaking] convert PortOffset in to struct with private fields (#218)
  • [breaking] Make PortGraph generic on node and port types (#230)

Performance

  • Avoid double graph traversals in insert_graph (#206)

Refactor

  • [breaking] Add MaybeNodeIndex/PortIndex for performance (#232)

New contributors

  • @gluonhiggs

- Rust
Published by hugrbot 11 months ago

https://github.com/cqcl/portgraph - v0.14.1

New Features

  • Implement petgraph traits on adaptors (#195)
  • FlatRegions that do not include their root node (#200)
  • Node style attributes in render options (#199)
  • Allow the FlatRegion to own its hierarchy (#201)

- Rust
Published by hugrbot about 1 year ago

https://github.com/cqcl/portgraph - v0.14.0

Others

  • [breaking] Bumped the public petgraph dependency to 0.8.1 (#193)

- Rust
Published by hugrbot about 1 year ago

https://github.com/cqcl/portgraph - v0.13.3

Bug Fixes

  • Fix panic when removing InPorts in MultiPortGraph::setnumports (#191)

- Rust
Published by hugrbot about 1 year ago

https://github.com/cqcl/portgraph - v0.13.2

Documentation

  • cleanups, clarify (+test) connected components (#180)

New Features

  • add Subgraph::copyinparent (#182)

Refactor

  • Simplify PortGraph::port_links (#188)

- Rust
Published by hugrbot over 1 year ago

https://github.com/cqcl/portgraph - v0.13.1

Bug Fixes

  • Mermaid render of graph views was empty (#175)
  • Hierarchy descendants return root siblings (#178)

- Rust
Published by hugrbot over 1 year ago

https://github.com/cqcl/portgraph - v0.13.0

This release has been focused on performance improvements. Subgraphs and region filters now avoid unnecessary full-graph traversals by using specialized implementation.

We also added a Boundary definition used for Subgraphs that can compute the partial order between its inputs and outputs.

New Features

  • [breaking] Use RPITIT for graph traits (#156)
  • [breaking] Added a Boundary definition and port partial-order computation (#164)

Performance

  • [breaking] Fix O(n) complexity in Subgraph (#157)
  • [breaking] Manual impl of Region/FlatRegion for improved perf (#162)

- Rust
Published by hugrbot over 1 year ago

https://github.com/cqcl/portgraph - v0.12.3

New Features

  • Fastpath for is_node_convex on a single node (#153)

- Rust
Published by hugrbot over 1 year ago

https://github.com/cqcl/portgraph - v0.12.2

Bug Fixes

  • Intergraph edges in mermaid rendering (#139)

New Features

  • Add PortOffset::opposite (#136)
  • Efficient LCA algorithm for the hierarchy (#138)

Testing

  • Use insta for mermaid/dot render tests (#137)

- Rust
Published by hugrbot almost 2 years ago

https://github.com/cqcl/portgraph - v0.12.1

Bug Fixes

  • Link and neighbour iterators counting self-loops twice (#132)

- Rust
Published by hugrbot almost 2 years ago