A novel and faster algorithm has recently been proposed for finding Pauli flow on open graphs, see Mitosek and Backens, An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms, arXiv: 2410.23439 (preprint).

An efficient implementation of this algorithm would be a good feature for Graphix. Additionally a thorough profiling of the implementation together with a benchmark against the previous algorithm would allow to check if there are any issues coming up in practice.