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