  In this note, we revisit the rounding algorithm of Wajc. Wajc gave a
fully-adaptive randomized algorithm that rounds a dynamic fractional matching
in an unweighted bipartite graph to an integral matching of nearly the same
value in $O(\text{poly}(\log n,\frac{1}{\varepsilon}))$ update time. We give
show that the guarantees of this algorithm hold for general graphs as well.
Additionally, we show useful properties of this subroutine which have
applications in rounding weighted fractional matchings.
