search

abstract fun search(graph: Graph<T, W>, source: Node<T>): Sequence<Visit<T, S>>

Lazily traverses graph starting from source, according to this strategy, yielding a Visit for each node reached along the way (including source itself).