Solves the "good matchings" problem for the FMES algorithm. Essentially pairs nodes that match between documents. Uses the "fast match" algorithm is detailed in the paper "Change Detection in Hierarchically Structure Information". WARNING: Will only work correctly with acylic documents. TODO: Add
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected