linear-maps-0.6: Finite maps for linear use
Source code
Contents
Index
Data.Graph.IdMap
Documentation
type
Children
a = a -> [a]
Source
depthFirstWalk'
::
I
m =>
Children
(
Id
a) ->
Set
m a -> [
Id
a] -> (
Set
m a, [
Id
a])
Source
depthFirstWalk
::
I
m =>
Children
(
Id
a) ->
Set
m a -> [
Id
a] -> [
Id
a]
Source
data
Task
a
Source
Constructors
Return
a
Visit
a
postOrderWalk
::
I
m =>
Children
(
Id
a) ->
Set
m a -> [
Id
a] -> [
Id
a]
Source
scc
::
I
m =>
Set
m a ->
Set
m a ->
Children
(
Id
a) ->
Children
(
Id
a) -> [
Id
a] -> [[
Id
a]]
Source
mapWalk
::
I
m =>
Set
m a ->
Children
(
Id
a) -> [
Id
a] -> [[
Id
a]]
Source
Produced by
Haddock
version 2.4.2