public static <V, E extends GEdge<V>> Set<V> findDominance(GDirectedGraph<V, E> g, V from,
			TaskMonitor monitor) throws CancelledException {

		ChkDominanceAlgorithm<V, E> algo = new ChkDominanceAlgorithm<>(g, monitor);
		Set<V> dominated = algo.getDominated(from);
		return dominated;
	}
Returns a set of all vertices that are dominated by the given vertex.  A node 'a' 
dominates node 'b' if all paths from start to 'b' contain 'a';
a node always dominates itself (except in 'strict dominance', which is all
dominators except for itself)

@param g the graph
@param from the vertex for which to find dominated vertices
@param monitor the monitor
@return the set of dominated vertices
@throws CancelledException if the monitor is cancelled
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GraphAlgorithms.java