causal_hub/graphs/algorithms/traversal/
mod.rs

1/// Traversal enumerator.
2pub enum Traversal {
3    /// Tree variant, i.e. only vertices reachable from the source vertex are visited.
4    Tree,
5    /// Forest variant, i.e. any vertex in the graph is visited.
6    Forest,
7}
8
9mod breadth_first_search;
10pub use breadth_first_search::*;
11
12mod depth_first_search;
13pub use depth_first_search::*;
14
15mod depth_first_search_edges;
16pub use depth_first_search_edges::*;
17
18mod lexicographic_breadth_first_search;
19pub use lexicographic_breadth_first_search::*;
20
21mod lexicographic_depth_first_search;
22pub use lexicographic_depth_first_search::*;
23
24mod topological_sort;
25pub use topological_sort::*;