Refactor of flow tools - XZ-corrections from pattern

CHANGELOG.md

@@ -37,6 +37,9 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 - #402: Support for Python 3.14.
 
+- #407: Introduced new method `graphix.optimization.StandardizedPattern.extract_xzcorrections` and its wrapper `graphix.pattern.Pattern.extract_xzcorrections` which extract an `XZCorrections` instance from a pattern. 
+
+
 ### Fixed
 
 - #392: `Pattern.remove_input_nodes` is required before the `Pattern.perform_pauli_measurements` method to ensure input nodes are removed and fixed in the |+> state.
@@ -57,6 +60,8 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 - #409: Axis labels are shown when visualizing a pattern. Legend is placed outside the plot so that the graph remains visible.
 
+- #407: Fixed an unreported bug in `OpenGraph.is_equal_structurally` which failed to compare open graphs differing on the output nodes only.
+
 ### Changed
 
 - #374: Adapted existing method `graphix.opengraph.OpenGraph.isclose` to the new API introduced in #358.
@@ -70,6 +75,10 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
   π. In particular, angles that appear in parameters of circuit
   instructions are now expressed in units of π.
 
+- #407:
+  - Modified the constructor `XZCorrections.from_measured_nodes_mapping` so that it doesn't need to create an `nx.DiGraph` instance. This fixes an unreported bug in the method.
+  - Removed modules `graphix.gflow` and `graphix.find_pflow`.
+
 ## [0.3.3] - 2025-10-23
 
 ### Added

docs/source/modifier.rst

@@ -58,8 +58,6 @@ Pattern Manipulation
 
     .. automethod:: max_space
 
-    .. automethod:: get_layers
-
     .. automethod:: to_qasm3
 
 

docs/source/references.rst

@@ -10,7 +10,6 @@ Module reference
     simulator
     graphsim
     extraction
-    flow
     clifford
     visualization
     channels

examples/rotation.py

@@ -53,7 +53,7 @@
 # Since there's no two-qubit gates applied to the two qubits in the original gate sequence,
 # we see decoupled 1D graphs representing the evolution of single qubits.
 # The arrows are the ``information flow  <https://journals.aps.org/pra/abstract/10.1103/PhysRevA.74.052310>``
-# of the MBQC pattern, obtained using the flow-finding algorithm implemented in :class:`graphix.gflow.flow`.
+# of the MBQC pattern, obtained using the flow-finding algorithm implemented in :class:`graphix.flow`.
 # Below we list the meaning of the node boundary and face colors.
 #
 # - Nodes with red boundaries are the *input nodes* where the computation starts.