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

		ChkPostDominanceAlgorithm<V, E> algo = new ChkPostDominanceAlgorithm<>(g, monitor);
		Set<V> postDominated = algo.getDominated(from);
		return postDominated;
	}
Returns a set of all vertices that are post-dominated by the given vertex.  A node 'b' 
is said to post-dominate node 'a' if all paths from 'a' to END contain 'b'.

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