Method reachableNodes

guava/src/com/google/common/graph/Graphs.java:278–281

Returns the set of nodes that are reachable from {@code node}. Specifically, it returns all nodes {@code v} such that there exists a path (a sequence of adjacent outgoing edges) starting at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first element in the re

(Graph<N> graph, N node)

   * @since 33.1.0 (present with return type {@code Set} since 20.0)
   */
  public static <N> ImmutableSet<N> reachableNodes(Graph<N> graph, N node) {
    checkArgument(graph.nodes().contains(node), NODE_NOT_IN_GRAPH, node);
    return ImmutableSet.copyOf(Traverser.forGraph(graph).breadthFirst(node));
  }

  // Graph mutation methods