A lot of traversals pass through the graph in a tree. It might be cool to have an abstraction for this concept and a way to get an actual Tree (Data.Tree?) out of anything under the abstraction.
Along these lines, there should be versions of DFS and BFS which only perform the tree traversal on edges, rather than hitting every edge.
A lot of traversals pass through the graph in a tree. It might be cool to have an abstraction for this concept and a way to get an actual Tree (Data.Tree?) out of anything under the abstraction.
Along these lines, there should be versions of DFS and BFS which only perform the tree traversal on edges, rather than hitting every edge.