@spec dominates?(map(), term(), term()) :: boolean()

Checks if a dominates b in the given idom map.

@spec frontier(Graph.t(), map()) :: %{required(term()) => MapSet.t()}

Computes the dominance frontier for each node.

The dominance frontier of a node N is the set of nodes where N's dominance ends — where a node has a predecessor dominated by N but is not itself strictly dominated by N.

@spec idom(Graph.t(), term()) :: %{required(term()) => term()}

Computes the immediate dominator map for a directed graph.

Returns %{vertex => immediate_dominator}. The root vertex maps to itself.

@spec ipdom(Graph.t(), term()) :: %{required(term()) => term()}

Computes the immediate post-dominator map.

Reverses the CFG and computes dominators from the exit node.

@spec tree(map()) :: Graph.t()

Builds a dominator tree from an immediate dominator map.

Returns a Graph.t() where edges go from dominator to dominated.