-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Graph walk abstraction
--   
--   Walk over a graph, abstracting away from the underlying
--   representation, not caring about precise order
@package graph-visit
@version 0.1


-- | This module provides a graph visiting abstraction
module Data.Graph.GraphVisit

-- | Abstract graph visit, over arbitrary structures, using state holding
--   visited nodes (also acting als start) and an accumulator <tt>thr</tt>.
--   All is done in strict StateT.
graphVisitM :: (Ord node, Monad m) => (thr -> graph -> node -> (thr, Set node)) -> graph -> StateT (GraphVisitState node thr) m ()

-- | Abstract graph visit, running graphVisitM
graphVisit :: Ord node => (thr -> graph -> node -> (thr, Set node)) -> Set node -> graph -> thr -> (thr, Set node)