{"ast_node_type":"other","tokens":[{"end":92,"kind":"keyword","start":0,"text":"///"}]}
///     tree, that is each vertex may have at most one successor and there may be no cycles.
///     that are not cleanup vertices or are not reachable. The resulting graph must be an inverted
#[derive(Clone, TyEncodable, TyDecodable, Hash, HashStable, PartialEq, TypeFoldable, TypeVisitable)]