Data.Graph.Traversal

Documentation

bfsVertices :: (Graph g, Hashable v, Eq v, Ord v) => g v e -> v -> [v]

breadh-first-search vertices starting at a particular vertex

dfsVertices :: (Graph g, Hashable v, Eq v, Ord v) => g v e -> v -> [v]

depth-first-search vertices starting at a particular vertex