[−][src]Module pathfinding::directed::dfs

Functions

dfs	Compute a path using the depth-first search algorithm. The path starts from `start` up to a node for which `success` returns `true` is computed and returned along with its total cost, in a `Some`. If no path can be found, `None` is returned instead.