post-dominators for a given graph can be found by running dominators algorithm on the graph with reversed nodes (that is, where "from" and "to" nodes are swapped).
also updating the definition of the root that is not necessarily the first node in the graph, but rather the one that has no predecessors.
post-dominators for a given graph can be found by running dominators algorithm on the graph with reversed nodes (that is, where "from" and "to" nodes are swapped).
also updating the definition of the root that is not necessarily the first node in the graph, but rather the one that has no predecessors.