{"ast_node_type":"other","tokens":[{"end":99,"kind":"keyword","start":0,"text":"///"}]}
///     that are not cleanup vertices or are not reachable. The resulting graph must be an inverted
///     deleting self edges and duplicate edges in the process. Now remove all vertices from `G`
///     tree, that is each vertex may have at most one successor and there may be no cycles.