Agda-2.2.6: A dependently typed functional programming language and proof assistant
Source code
Contents
Index
Agda.Utils.Graph
Documentation
newtype
Graph
n e
Source
Constructors
Graph
unGraph
::
Map
n (
Map
n e)
edges
::
Ord
n =>
Graph
n e -> [(n, n, e)]
Source
nodes
::
Ord
n =>
Graph
n e ->
Set
n
Source
fromList
:: (
SemiRing
e,
Ord
n) => [(n, n, e)] ->
Graph
n e
Source
empty
::
Graph
n e
Source
singleton
:: n -> n -> e ->
Graph
n e
Source
insert
:: (
SemiRing
e,
Ord
n) => n -> n -> e ->
Graph
n e ->
Graph
n e
Source
union
:: (
SemiRing
e,
Ord
n) =>
Graph
n e ->
Graph
n e ->
Graph
n e
Source
unions
:: (
SemiRing
e,
Ord
n) => [
Graph
n e] ->
Graph
n e
Source
lookup
::
Ord
n => n -> n ->
Graph
n e ->
Maybe
e
Source
neighbours
::
Ord
n => n ->
Graph
n e -> [(n, e)]
Source
growGraph
:: (
SemiRing
e,
Ord
n) =>
Graph
n e ->
Graph
n e
Source
transitiveClosure
:: (
SemiRing
e,
Ord
n) =>
Graph
n e ->
Graph
n e
Source
findPath
:: (
SemiRing
e,
Ord
n) => (e ->
Bool
) -> n -> n ->
Graph
n e ->
Maybe
e
Source
allPaths
:: (
SemiRing
e,
Ord
n,
Ord
c) => (e -> c) -> n -> n ->
Graph
n e -> [e]
Source
Produced by
Haddock
version 2.4.2