public Set<V> getAllReachableVertices(Set<V> sourceVertices) {
		Set<E> relatedEdges = new HashSet<>();
		for (V v : sourceVertices) {
			relatedEdges.addAll(GraphAlgorithms.getEdgesFrom(completeGraph, asList(v), true));
			relatedEdges.addAll(GraphAlgorithms.getEdgesFrom(completeGraph, asList(v), false));
		}

		return GraphAlgorithms.toVertices(relatedEdges);
	}
Returns all vertices that are reachable by the given vertices.

<P>This method is needed if you wish to find relationships that have been filtered 
out.

@param sourceVertices the vertices for which to find the other reachable vertices
@return the reachable vertices
Ghidra/Framework/Graph/src/main/java/ghidra/graph/graphs/FilteringVisualGraph.java