{"ast_node_type":"other","tokens":[{"end":23,"kind":"keyword","start":0,"text":"///"}]}
/// a topological sort.
/// Note that for a graph containing no loops (i.e., A DAG), this is equivalent to
pub fn reverse_postorder<'a, 'tcx>(