graphs-0.3.2.1: A simple monadic graph library

Portabilitytype families
Stabilityexperimental
MaintainerEdward Kmett <ekmett@gmail.com>

Data.Graph.Algorithm.BreadthFirstSearch

Description

Breadth-first search

Synopsis

Documentation

bfs :: (AdjacencyListGraph g, Monoid m) => Bfs g m -> Vertex g -> g mSource

data Bfs g m Source

Breadth first search visitor

Constructors

Bfs 

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 (Bfs g) 
Graph g => Functor (Bfs g) 
Graph g => Applicative (Bfs g) 
(Graph g, Monoid m) => Monoid (Bfs g m) 
(Graph g, Monoid m) => Default (Bfs g m)