public static <V, E extends GEdge<V>> GDirectedGraph<V, GEdge<V>> findDominanceTree(
			GDirectedGraph<V, E> g, TaskMonitor monitor) throws CancelledException {
		ChkDominanceAlgorithm<V, E> algorithm = new ChkDominanceAlgorithm<>(g, monitor);
		return algorithm.getDominanceTree();
	}
Returns the dominance tree of the given graph.  A dominator tree of the vertices where each 
node's children are those nodes it *immediately* dominates (a idom b)

@param g the graph
@param monitor the task monitor
@return the tree
@throws CancelledException if the monitor is cancelled
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GraphAlgorithms.java