Incorrect documentation for `dfs_tree`.

[iago-lito]

Graphs.jl/src/traversals/dfs.jl

Lines 84 to 89 in bf9544b

	"""
	dfs_tree(g, s)
	Return an ordered vector of vertices representing a directed acyclic graph based on
	depth-first traversal of the graph `g` starting with source vertex `s`.
	"""

The function does not return a vector of vertices but a graph. Also, it does accept a dir keyword argument, just like bfs_tree.

[gdalle]

Good catch! Do you want to submit a documentation PR to fix it?

[gdalle]

Closed by #367