the graph to traverse on
direction in which to traverse
the ids of nodes that the traverser will go to next if the node has no
neighbors, or we reset the traversal with probability resetProbability
,
or if the number of out-going edges at the current node exceeds maxNumEdgesThresh
the probability of teleporting back to home node set at each step
if set, do not traverse edges with > maxNumEdgesThresh outgoing edges
specifies whether the same node should only be allowed to be visited once in any path.
a random number generator (for stable walk, a seeded random number generator is used).
if set, max depth of path
filter home node by number of edges
(Changed in version 2.8.0) collect
has changed. The previous behavior can be reproduced with toSeq
.
Traverser only visits node Ids listed in some node's edges, and thus we know that node must exist, safe to assume graph.
Traverser only visits node Ids listed in some node's edges, and thus we know that node must exist, safe to assume graph.getNodeById return non-None value
(Since version 2.10.0) use fold instead
Randomly traverse the graph, going from one node to a random neighbor in direction
dir
.