private static <V, E extends GEdge<V>> boolean isSelfContainedStrongComponent(
			GDirectedGraph<V, E> g, Set<V> strongComponent) {

		Set<V> parents = new HashSet<>();
		for (V v : strongComponent) {
			parents.addAll(g.getPredecessors(v));
		}

		// check to see if the given set of vertices has an incoming edge that is outside of 
		// the strong component
		return strongComponent.containsAll(parents);
	}
Returns true if the given strong component has no incoming edges that are outside of 
the component.  This is useful to know, as it signals that the given strong component
is reachable from outside of that component.

@param g the graph
@param strongComponent the set of vertices representing a strong component
@return true if the given strong component has no incoming edges that are outside of 
		   the component
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GraphAlgorithms.java