{"ast_node_type":"other","tokens":[{"end":3,"kind":"keyword","start":0,"text":"///"}]}
///
/// A depth-first search that also tracks when all successors of a node have been examined.
/// This is based on the DFS described in [Introduction to Algorithms (1st ed.)][CLR], hereby