fn greedy_matching_inner<G>(graph: &G) -> (Vec<Option<G::NodeId>>, usize)where G: Visitable + IntoNodeIdentifiers + NodeIndexable + IntoNeighbors,