Skip to content

Releases: Quantinuum/portgraph

v0.15.3

08 Dec 17:35
35e1b5a

Choose a tag to compare

New Features

  • Added support for pyo3 0.27

v0.15.2

06 Aug 10:36
76591b1

Choose a tag to compare

Bug Fixes

  • Handle multiports in TopoSort (#236)

New Features

  • New ConvexChecker algorithm for Circuit-like graphs (#240)
  • Add LineConvexChecker::nodes_in_interval (#241)
  • Add LineConvexChecker::lines_at_port (#242)

v0.15.1

19 Jul 17:54
7f9bd9b

Choose a tag to compare

Bug Fixes

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

v0.15.0

18 Jul 10:51
f1f51b9

Choose a tag to compare

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

v0.14.1

28 Apr 15:31
7b7226c

Choose a tag to compare

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)

v0.14.0

08 Apr 13:41
60010cf

Choose a tag to compare

Others

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

v0.13.3

04 Mar 14:51
6238c81

Choose a tag to compare

Bug Fixes

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

v0.13.2

24 Feb 19:45
e51c4e6

Choose a tag to compare

Documentation

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

New Features

  • add Subgraph::copy_in_parent (#182)

Refactor

  • Simplify PortGraph::port_links (#188)

v0.13.1

20 Jan 17:58
97fa7b8

Choose a tag to compare

Bug Fixes

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

v0.13.0

17 Jan 11:58
8f46ae0

Choose a tag to compare

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)