private void doGetDominated(V a, Set<V> results) {
		add(a, results); // a node always dominates itself
		List<V> dominated = dominatedMap.get(a);
		dominated.forEach(b -> doGetDominated(b, 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