public Set<V> getDominated(V a) {
		HashSet<V> results = new HashSet<>();
		doGetDominated(a, results);
		return results;
	}
Returns all nodes dominated by the given vertex.  A node 'a' dominates node 'b' if 
all paths from start to 'b' contain 'a'.

@param a the vertex
@return the dominated vertices
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/ChkDominanceAlgorithm.java