{"ast_node_type":"other","tokens":[{"end":80,"kind":"keyword","start":0,"text":"///"}]}
/// A reverse postorder traversal of this graph is either `A B C D` or `A C B D`
///
/// Note that for a graph containing no loops (i.e., A DAG), this is equivalent to