{"ast_node_type":"other","tokens":[{"end":96,"kind":"keyword","start":0,"text":"///"}]}
///     deleting self edges and duplicate edges in the process. Now remove all vertices from `G`
///     vertices `u` and `v` such that `u` dominates `v`, contract `u` and `v` into a single vertex,
///     that are not cleanup vertices or are not reachable. The resulting graph must be an inverted