Copyright	(C) 2011 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <[email protected]>
Stability	experimental
Portability	type families
Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Graph.Algorithm

Description

Functions and data structures common to graph search algorithms

Synopsis

Documentation

Graph search visitor

Constructors

Fields

enterVertex :: Vertex g -> g m
Called the first time a vertex is discovered
enterEdge :: Edge g -> g m
Called the first time an edge is discovered, before enterVertex
grayTarget :: Edge g -> g m
Called when we encounter a back edge to a vertex we're still processing
exitVertex :: Vertex g -> g m
Called once we have processed all descendants of a vertex
blackTarget :: Edge g -> g m
Called when we encounter a cross edge to a vertex we've already finished

Instances details

Graph g => Applicative (GraphSearch g) Source #
Instance details Defined in Data.Graph.Algorithm Methods pure :: a -> GraphSearch g a # (<>) :: GraphSearch g (a -> b) -> GraphSearch g a -> GraphSearch g b # liftA2 :: (a -> b -> c) -> GraphSearch g a -> GraphSearch g b -> GraphSearch g c # (>) :: GraphSearch g a -> GraphSearch g b -> GraphSearch g b # (<*) :: GraphSearch g a -> GraphSearch g b -> GraphSearch g a #
Graph g => Functor (GraphSearch g) Source #
Instance details Defined in Data.Graph.Algorithm Methods fmap :: (a -> b) -> GraphSearch g a -> GraphSearch g b # (<$) :: a -> GraphSearch g b -> GraphSearch g a #
Graph g => Monad (GraphSearch g) Source #
Instance details Defined in Data.Graph.Algorithm Methods (>>=) :: GraphSearch g a -> (a -> GraphSearch g b) -> GraphSearch g b # (>>) :: GraphSearch g a -> GraphSearch g b -> GraphSearch g b # return :: a -> GraphSearch g a #
(Graph g, Monoid m) => Monoid (GraphSearch g m) Source #
Instance details Defined in Data.Graph.Algorithm Methods mempty :: GraphSearch g m # mappend :: GraphSearch g m -> GraphSearch g m -> GraphSearch g m # mconcat :: [GraphSearch g m] -> GraphSearch g m #
(Graph g, Semigroup m) => Semigroup (GraphSearch g m) Source #
Instance details Defined in Data.Graph.Algorithm Methods (<>) :: GraphSearch g m -> GraphSearch g m -> GraphSearch g m # sconcat :: NonEmpty (GraphSearch g m) -> GraphSearch g m # stimes :: Integral b => b -> GraphSearch g m -> GraphSearch g m #