Data.Graph.Algorithm.DepthFirstSearch

Depth-first search

Documentation

dfs :: (AdjacencyListGraph g, Monoid m) => Dfs g m -> Vertex g -> g m

data Dfs g m

Constructors

Dfs

Fields

enterVertex :: Vertex g -> g m

grayTarget :: Edge g -> g m

exitVertex :: Vertex g -> g m

blackTarget :: Edge g -> g m

Instances

Graph g => Monad (Dfs g)

Graph g => Functor (Dfs g)

Graph g => Applicative (Dfs g)

(Graph g, Monoid m) => Monoid (Dfs g m)