RandomWalkGraphExtension<V, E> extension

on

• Graph<V, E>

Methods

randomWalk(V vertex, {num edgeProbability(V source, V target)?, bool selfAvoiding = false, Random? random, StorageStrategy<V>? vertexStrategy}) → Iterable<V>

Available on Graph<V, E>, provided by the RandomWalkGraphExtension extension

Traverses the vertices in a random order.