{"ast_node_type":"other","tokens":[{"end":106,"kind":"keyword","start":0,"text":"//"}]}
    // preorder number such that there exists a path from v to w in which all elements (other than w) have
    // A semidominator for a given vertex w (semi[w]) is the vertex v with minimum
    // preorder numbers greater than w (i.e., this path is not the tree path to