Marks and Unger [1]}
used a bounded integral-valued Borel flow in the Schreier graph induced by finitely many translations
to find an equidecomposition of equidistributed sets. Our main technical contribution is a simple Borel algorithm for rounding flows that applies beyond the case of graphs arising from \(\mathbb {Z}^d\)  actions. It relies on the notion of connected toasts (see Definition REF ), which were introduced by the authors in [2]}. They are known to exist a.e. in all one-ended hyperfinite graphings, as well as in Borel actions of \(\mathbb {Z}^d\) . By a recent result of the first author, Poulin and Zomback [3]} they also exist in Borel actions of polynomial growth groups.
