edgegraph.traversal.depthfirst.dft_iterative

edgegraph.traversal.depthfirst.dft_iterative(uni, start, *, direction_sensitive=0, unknown_handling=2, ff_via=None, ff_result=None)

Perform an iterative depth-first traversal of the given universe, starting at the given vertex (non-generator).

See also

Please refer to the documentation of idft_iterative()! This function simply wraps that one, only forcing full expansion to a list before returning. All parameters are exactly the same and passed through without alteration.

Returns:

A list of vertices in the order of an iterative depth-first traversal.

Raises:

ValueError – if the start vertex is not a member of the specified universe, or if the universe is empty.

Return type:

list[Vertex]