Skip to content
This repository has been archived by the owner on Oct 8, 2021. It is now read-only.

Commit

Permalink
Add topological_sort_by_dfs to docs on traversals
Browse files Browse the repository at this point in the history
Solves #1566
  • Loading branch information
gdalle authored Aug 30, 2021
1 parent ddaf3d3 commit 712b8d1
Showing 1 changed file with 1 addition and 0 deletions.
1 change: 1 addition & 0 deletions docs/src/pathing.md
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,7 @@ Any graph traversal will traverse an edge only if it is present in the graph. W

```@docs
bfs_tree
topological_sort_by_dfs
dfs_tree
maximum_adjacency_visit
bfs_parents
Expand Down

0 comments on commit 712b8d1

Please sign in to comment.