algebraic-graphs-0.5: A library for algebraic graph construction and transformation (Index - F)

algebraic-graphs-0.5: A library for algebraic graph construction and transformation

A
B
C
D
E
F
G
H
I
J
L
M
N
O
P
R
S
T
U
V
W
Z
:
<
=
>
-
All

Index - F

finite	Algebra.Graph.Label
finiteWord	Algebra.Graph.Label
Focus
1 (Type/Class)	Algebra.Graph.Internal
2 (Data Constructor)	Algebra.Graph.Internal
foldg
1 (Function)	Algebra.Graph
2 (Function)	Algebra.Graph.Labelled
3 (Function)	Algebra.Graph.ToGraph
4 (Function)	Algebra.Graph.Undirected
foldg1	Algebra.Graph.NonEmpty
foldr1Safe	Algebra.Graph.Internal
forEach	Algebra.Graph.Internal
forEachInt	Algebra.Graph.Internal
forest
1 (Function)	Algebra.Graph.AdjacencyMap
2 (Function)	Algebra.Graph.AdjacencyIntMap
3 (Function)	Algebra.Graph
4 (Function)	Algebra.Graph.HigherKinded.Class
5 (Function)	Algebra.Graph.Relation
6 (Function)	Algebra.Graph.Relation.Symmetric
7 (Function)	Algebra.Graph.Undirected
8 (Function)	Algebra.Graph.Class
fromAcyclic	Algebra.Graph.Acyclic.AdjacencyMap
fromAdjacencyIntMap	Data.Graph.Typed
fromAdjacencyIntSets	Algebra.Graph.AdjacencyIntMap
fromAdjacencyMap
1 (Function)	Algebra.Graph.AdjacencyIntMap
2 (Function)	Data.Graph.Typed
fromAdjacencyMaps	Algebra.Graph.Labelled.AdjacencyMap
fromAdjacencySets	Algebra.Graph.AdjacencyMap
fromBipartite	Algebra.Graph.Bipartite.Undirected.AdjacencyMap
fromBipartiteWith	Algebra.Graph.Bipartite.Undirected.AdjacencyMap
fromNonEmpty	Algebra.Graph.NonEmpty.AdjacencyMap
fromRelation
1 (Function)	Algebra.Graph.Relation.Transitive
2 (Function)	Algebra.Graph.Relation.Reflexive
3 (Function)	Algebra.Graph.Relation.Preorder
fromSymmetric	Algebra.Graph.Relation.Symmetric
fromUndirected	Algebra.Graph.Undirected
fromVertexKL	Data.Graph.Typed