Transforms this vertex and all of its descendants (all vertices reachable through its "outs").
Transforms this vertex and all of its descendants (all vertices reachable through its "outs"). It is guaranteed that each vertex will be visited exactly once, after all of its outs have been processed. When an vertex is reachable through multiple paths, it will be transformed once and the resulting vertex will be placed at the corresponding locations in all the paths. A tree must be processed within one call or else it's possible to get duplicates. So, don't explicitly call flatMap on the children of a vertex and piece it back together yourself.
a function called on each vertex prior to processing its descendents to determine whether this path needs to be pursued. If you know that this vertex will be pruned, this method should return true to avoid processing its descendents.
the function used to transform each vertex. The first argument is the original vertex (pre- transformation). The second argument is the set of successors that the transformed vertex should include in its outs. Note that this may be different from the successors of the original vertex that it passed in. Those should likely be ignored. The return value should be the newly transformed vertices with which the source vertex should be replaced.
Transforms this vertex and all of its successors (all vertices reachable through its "outs").
Transforms this vertex and all of its successors (all vertices reachable through its "outs"). It is guaranteed that each vertex will be visited exactly once, after all of its outs have been processed. When an vertex is reachable through multiple paths, it will be transformed once and the resulting vertex will be placed at the corresponding locations in all the paths. A tree must be processed within one call or else it's possible to get duplicates. So, don't explicitly call flatMap on the successors of a vertex and piece it back together yourself.
the function used to transform each vertex. The first argument is the original vertex (pre- transformation). The second argument is the set of successors that the transformed vertex should include in its outs. Note that this may be different from the outs of the original vertex that it passed in. Those should likely be ignored. The return value should be the newly transformed vertex with the child vertices provided.
Removes paths in the graph that can not reach an EntryReceiver.
Removes paths in the graph that can not reach an EntryReceiver. This currently includes:
Calls the specified function exactly once for each vertex reachable from the specified root vertex.
Calls the specified function exactly once for each vertex reachable from the specified root vertex. Even if there are multiple paths to a given vertex, the function will only be called once for that vertex. The traversal is depth-first, so all of an vertex's successors are guaranteed to be visited before the vertex itself.