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

Index

-< 
1 (Function)Algebra.Graph.Labelled.AdjacencyMap
2 (Function)Algebra.Graph.Labelled
:=Algebra.Graph.Export.Dot
<+> 
1 (Function)Algebra.Graph.Label
2 (Function)Algebra.Graph.Export
<.>Algebra.Graph.Label
=== 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.NonEmpty
>- 
1 (Function)Algebra.Graph.Labelled.AdjacencyMap
2 (Function)Algebra.Graph.Labelled
AberdeenAlgebra.Graph.Labelled.Example.Network
AdjacencyIntMapAlgebra.Graph.AdjacencyIntMap
adjacencyIntMap 
1 (Function)Algebra.Graph.AdjacencyIntMap
2 (Function)Algebra.Graph.ToGraph
adjacencyIntMapTransposeAlgebra.Graph.ToGraph
adjacencyList 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Acyclic.AdjacencyMap
5 (Function)Algebra.Graph.Relation
6 (Function)Algebra.Graph.Relation.Symmetric
7 (Function)Algebra.Graph.ToGraph
8 (Function)Algebra.Graph.Undirected
AdjacencyMap 
1 (Type/Class)Algebra.Graph.AdjacencyMap
2 (Type/Class)Algebra.Graph.Bipartite.AdjacencyMap
3 (Type/Class)Algebra.Graph.Labelled.AdjacencyMap
4 (Type/Class)Algebra.Graph.NonEmpty.AdjacencyMap
5 (Type/Class)Algebra.Graph.Acyclic.AdjacencyMap
adjacencyMap 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.Labelled.AdjacencyMap
3 (Function)Algebra.Graph.ToGraph
adjacencyMapTransposeAlgebra.Graph.ToGraph
AllShortestPathsAlgebra.Graph.Label
AlphabetAlgebra.Graph.Labelled.Example.Automaton
AttributeAlgebra.Graph.Export.Dot
attributeQuotingAlgebra.Graph.Export.Dot
augmentingPathAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
AutomatonAlgebra.Graph.Labelled
bfs 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
bfsForest 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
biclique 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.Undirected
9 (Function)Algebra.Graph.Class
biclique1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
bimapAlgebra.Graph.Bipartite.AdjacencyMap
box 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph
3 (Function)Algebra.Graph.Bipartite.AdjacencyMap
4 (Function)Algebra.Graph.Acyclic.AdjacencyMap
5 (Function)Algebra.Graph.NonEmpty
boxWithAlgebra.Graph.Bipartite.AdjacencyMap
bracketsAlgebra.Graph.Export
buildg 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.Labelled
CancelAlgebra.Graph.Labelled.Example.Automaton
CapacityAlgebra.Graph.Label
capacityAlgebra.Graph.Label
cartesianProductWithAlgebra.Graph.Internal
ChoiceAlgebra.Graph.Labelled.Example.Automaton
circuit 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.Undirected
9 (Function)Algebra.Graph.Class
circuit1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
CityAlgebra.Graph.Labelled.Example.Network
clique 
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
clique1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
closure 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph.Labelled.AdjacencyMap
4 (Function)Algebra.Graph.Labelled
5 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
6 (Function)Algebra.Graph.Relation
coerce00Algebra.Graph.Internal
coerce01Algebra.Graph.Internal
coerce10Algebra.Graph.Internal
coerce11Algebra.Graph.Internal
coerce20Algebra.Graph.Internal
coerce21Algebra.Graph.Internal
CoffeeAlgebra.Graph.Labelled.Example.Automaton
coffeeTeaAutomatonAlgebra.Graph.Labelled.Example.Automaton
complementAlgebra.Graph.Undirected
CompleteAlgebra.Graph.Labelled.Example.Automaton
compose 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Relation
Connect 
1 (Data Constructor)Algebra.Graph
2 (Data Constructor)Algebra.Graph.Labelled
3 (Data Constructor)Algebra.Graph.NonEmpty
connect 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
13 (Function)Algebra.Graph.Class
connectFociAlgebra.Graph.Internal
connects 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.Undirected
9 (Function)Algebra.Graph.Class
connects1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
ConsAlgebra.Graph.Bipartite.AdjacencyMap
consistent 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph.Bipartite.AdjacencyMap
4 (Function)Algebra.Graph.Labelled.AdjacencyMap
5 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
6 (Function)Algebra.Graph.Acyclic.AdjacencyMap
7 (Function)Algebra.Graph.Relation
8 (Function)Algebra.Graph.Relation.Symmetric
consistentMatchingAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
Context 
1 (Type/Class)Algebra.Graph
2 (Data Constructor)Algebra.Graph
3 (Type/Class)Algebra.Graph.Labelled
4 (Data Constructor)Algebra.Graph.Labelled
context 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.Labelled
CountAlgebra.Graph.Label
countAlgebra.Graph.Label
CountShortestPathsAlgebra.Graph.Label
Cycle 
1 (Type/Class)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Type/Class)Algebra.Graph.AdjacencyMap.Algorithm
deBruijn 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.HigherKinded.Class
defaultEdgeAttributesAlgebra.Graph.Export.Dot
defaultStyleAlgebra.Graph.Export.Dot
defaultStyleViaShowAlgebra.Graph.Export.Dot
defaultVertexAttributesAlgebra.Graph.Export.Dot
detectPartsAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
dfs 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.ToGraph
4 (Function)Data.Graph.Typed
dfsForest 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.ToGraph
4 (Function)Data.Graph.Typed
dfsForestFrom 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.ToGraph
4 (Function)Data.Graph.Typed
DioidAlgebra.Graph.Label
DistanceAlgebra.Graph.Label
distanceAlgebra.Graph.Label
DocAlgebra.Graph.Export
domainAlgebra.Graph.Relation
DoubleQuotesAlgebra.Graph.Export.Dot
doubleQuotesAlgebra.Graph.Export
eastCoastAlgebra.Graph.Labelled.Example.Network
edge 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
13 (Function)Algebra.Graph.Class
edgeAttributesAlgebra.Graph.Export.Dot
edgeCount 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.ToGraph
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
edgeLabel 
1 (Function)Algebra.Graph.Labelled.AdjacencyMap
2 (Function)Algebra.Graph.Labelled
edgeList 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
8 (Function)Algebra.Graph.Acyclic.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.ToGraph
12 (Function)Algebra.Graph.NonEmpty
13 (Function)Algebra.Graph.Undirected
edges 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.Undirected
11 (Function)Algebra.Graph.Class
edges1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
edgeSet 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
8 (Function)Algebra.Graph.Acyclic.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.ToGraph
12 (Function)Algebra.Graph.NonEmpty
13 (Function)Algebra.Graph.Undirected
EdinburghAlgebra.Graph.Labelled.Example.Network
emap 
1 (Function)Algebra.Graph.Labelled.AdjacencyMap
2 (Function)Algebra.Graph.Labelled
Empty 
1 (Data Constructor)Algebra.Graph
2 (Data Constructor)Algebra.Graph.Labelled
empty 
1 (Function)Algebra.Graph.HigherKinded.Class
2 (Function)Algebra.Graph.AdjacencyMap
3 (Function)Algebra.Graph.AdjacencyIntMap
4 (Function)Algebra.Graph
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.Acyclic.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.Undirected
12 (Function)Algebra.Graph.Class
emptyFocusAlgebra.Graph.Internal
evenListAlgebra.Graph.Bipartite.AdjacencyMap
export 
1 (Function)Algebra.Graph.Export
2 (Function)Algebra.Graph.Export.Dot
exportAsIsAlgebra.Graph.Export.Dot
exportViaShowAlgebra.Graph.Export.Dot
finiteAlgebra.Graph.Label
finiteWordAlgebra.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
foldg1Algebra.Graph.NonEmpty
foldr1SafeAlgebra.Graph.Internal
forEachAlgebra.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
fromAcyclicAlgebra.Graph.Acyclic.AdjacencyMap
fromAdjacencyIntMapData.Graph.Typed
fromAdjacencyIntSetsAlgebra.Graph.AdjacencyIntMap
fromAdjacencyMap 
1 (Function)Algebra.Graph.AdjacencyIntMap
2 (Function)Data.Graph.Typed
fromAdjacencyMapsAlgebra.Graph.Labelled.AdjacencyMap
fromAdjacencySetsAlgebra.Graph.AdjacencyMap
fromBipartiteAlgebra.Graph.Bipartite.AdjacencyMap
fromBipartiteWithAlgebra.Graph.Bipartite.AdjacencyMap
fromNonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
fromRelation 
1 (Function)Algebra.Graph.Relation.Transitive
2 (Function)Algebra.Graph.Relation.Reflexive
3 (Function)Algebra.Graph.Relation.Preorder
fromSymmetricAlgebra.Graph.Relation.Symmetric
fromUndirectedAlgebra.Graph.Undirected
fromVertexKLData.Graph.Typed
getArgumentAlgebra.Graph.Label
getCapacityAlgebra.Graph.Label
getCountAlgebra.Graph.Label
getDistanceAlgebra.Graph.Label
getFiniteAlgebra.Graph.Label
getMinimumAlgebra.Graph.Label
getOptimumAlgebra.Graph.Label
getPowerSetAlgebra.Graph.Label
GlasgowAlgebra.Graph.Labelled.Example.Network
gmap 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph.Labelled.AdjacencyMap
4 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
5 (Function)Algebra.Graph.Relation
6 (Function)Algebra.Graph.Relation.Symmetric
Graph 
1 (Type/Class)Algebra.Graph
2 (Type/Class)Algebra.Graph.HigherKinded.Class
3 (Type/Class)Algebra.Graph.Labelled
4 (Type/Class)Algebra.Graph.NonEmpty
5 (Type/Class)Algebra.Graph.Undirected
6 (Type/Class)Algebra.Graph.Class
graphAttributesAlgebra.Graph.Export.Dot
GraphKL 
1 (Type/Class)Data.Graph.Typed
2 (Data Constructor)Data.Graph.Typed
graphNameAlgebra.Graph.Export.Dot
hasEdge 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
9 (Function)Algebra.Graph.Acyclic.AdjacencyMap
10 (Function)Algebra.Graph.Relation
11 (Function)Algebra.Graph.Relation.Symmetric
12 (Function)Algebra.Graph.ToGraph
13 (Function)Algebra.Graph.NonEmpty
14 (Function)Algebra.Graph.Undirected
hasLeftVertexAlgebra.Graph.Bipartite.AdjacencyMap
hasRightVertexAlgebra.Graph.Bipartite.AdjacencyMap
hasVertex 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
8 (Function)Algebra.Graph.Acyclic.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.ToGraph
12 (Function)Algebra.Graph.NonEmpty
13 (Function)Algebra.Graph.Undirected
indentAlgebra.Graph.Export
IndependentSetAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
independentSetSizeAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
induce 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.Undirected
induce1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
induceJust 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph
3 (Function)Algebra.Graph.Labelled.AdjacencyMap
4 (Function)Algebra.Graph.Labelled
5 (Function)Algebra.Graph.Acyclic.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.Undirected
induceJust1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
infiniteAlgebra.Graph.Label
inputs 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.Labelled
isAlgebra.Graph.Internal
isAcyclic 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.ToGraph
isDfsForestOf 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.ToGraph
isEmpty 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.ToGraph
11 (Function)Algebra.Graph.Export
12 (Function)Algebra.Graph.Undirected
isIndependentSetOfAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
isMatchingOfAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
isSubgraphOf 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
8 (Function)Algebra.Graph.Acyclic.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
13 (Function)Algebra.Graph.Class
isTopSortOf 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.ToGraph
isVertexCoverOfAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
isZeroAlgebra.Graph.Label
joinAlgebra.Graph.Acyclic.AdjacencyMap
JourneyTimeAlgebra.Graph.Labelled.Example.Network
LabelAlgebra.Graph.Label
leftAdjacencyListAlgebra.Graph.Bipartite.AdjacencyMap
leftAdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMap
leftVertexAlgebra.Graph.Bipartite.AdjacencyMap
leftVertexCountAlgebra.Graph.Bipartite.AdjacencyMap
leftVertexListAlgebra.Graph.Bipartite.AdjacencyMap
leftVertexSetAlgebra.Graph.Bipartite.AdjacencyMap
List 
1 (Type/Class)Algebra.Graph.Internal
2 (Type/Class)Algebra.Graph.Bipartite.AdjacencyMap
literalAlgebra.Graph.Export
LondonAlgebra.Graph.Labelled.Example.Network
MatchingAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
matchingAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
matchingSizeAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
maxIndependentSetAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
maxMatchingAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
maybeFAlgebra.Graph.Internal
mergeVertices 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.NonEmpty
9 (Function)Algebra.Graph.Undirected
mesh 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.HigherKinded.Class
3 (Function)Algebra.Graph.Bipartite.AdjacencyMap
mesh1Algebra.Graph.NonEmpty
MinimumAlgebra.Graph.Label
minVertexCoverAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
neighbours 
1 (Function)Algebra.Graph.Relation.Symmetric
2 (Function)Algebra.Graph.Undirected
NetworkAlgebra.Graph.Labelled
networkAlgebra.Graph.Labelled.Example.Network
NewcastleAlgebra.Graph.Labelled.Example.Network
NilAlgebra.Graph.Bipartite.AdjacencyMap
noMinimumAlgebra.Graph.Label
NonNegativeAlgebra.Graph.Label
NoQuotesAlgebra.Graph.Export.Dot
OddCycleAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
oddListAlgebra.Graph.Bipartite.AdjacencyMap
okAlgebra.Graph.Internal
oneAlgebra.Graph.Label
Optimum 
1 (Type/Class)Algebra.Graph.Label
2 (Data Constructor)Algebra.Graph.Label
osAlgebra.Graph.Internal
outputs 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.Labelled
Overlay 
1 (Data Constructor)Algebra.Graph
2 (Data Constructor)Algebra.Graph.NonEmpty
overlay 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
13 (Function)Algebra.Graph.Class
overlay1Algebra.Graph.NonEmpty
overlayFociAlgebra.Graph.Internal
overlays 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.Undirected
11 (Function)Algebra.Graph.Class
overlays1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
pairOfLeftAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
pairOfRightAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
PathAlgebra.Graph.Label
path 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.Undirected
9 (Function)Algebra.Graph.Class
path1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
PayAlgebra.Graph.Labelled.Example.Automaton
PaymentAlgebra.Graph.Labelled.Example.Automaton
postIntSet 
1 (Function)Algebra.Graph.AdjacencyIntMap
2 (Function)Algebra.Graph.ToGraph
postSet 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.Labelled.AdjacencyMap
3 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
4 (Function)Algebra.Graph.Acyclic.AdjacencyMap
5 (Function)Algebra.Graph.Relation
6 (Function)Algebra.Graph.ToGraph
PowerSet 
1 (Type/Class)Algebra.Graph.Label
2 (Data Constructor)Algebra.Graph.Label
preambleAlgebra.Graph.Export.Dot
preIntSet 
1 (Function)Algebra.Graph.AdjacencyIntMap
2 (Function)Algebra.Graph.ToGraph
Preorder 
1 (Type/Class)Algebra.Graph.HigherKinded.Class
2 (Type/Class)Algebra.Graph.Class
PreorderRelationAlgebra.Graph.Relation.Preorder
preSet 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.Labelled.AdjacencyMap
3 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
4 (Function)Algebra.Graph.Acyclic.AdjacencyMap
5 (Function)Algebra.Graph.Relation
6 (Function)Algebra.Graph.ToGraph
QuotingAlgebra.Graph.Export.Dot
reachabilityAlgebra.Graph.Labelled.Example.Automaton
reachable 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.ToGraph
Reflexive 
1 (Type/Class)Algebra.Graph.HigherKinded.Class
2 (Type/Class)Algebra.Graph.Class
reflexiveClosure 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph.Labelled.AdjacencyMap
4 (Function)Algebra.Graph.Labelled
5 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
6 (Function)Algebra.Graph.Relation
ReflexiveRelationAlgebra.Graph.Relation.Reflexive
RegularExpressionAlgebra.Graph.Label
Relation 
1 (Type/Class)Algebra.Graph.Relation
2 (Type/Class)Algebra.Graph.Relation.Symmetric
relationAlgebra.Graph.Relation
removeEdge 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
8 (Function)Algebra.Graph.Acyclic.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
removeLeftVertexAlgebra.Graph.Bipartite.AdjacencyMap
removeRightVertexAlgebra.Graph.Bipartite.AdjacencyMap
removeVertex 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.Undirected
removeVertex1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
renderAlgebra.Graph.Export
replaceEdge 
1 (Function)Algebra.Graph.Labelled.AdjacencyMap
2 (Function)Algebra.Graph.Labelled
replaceVertex 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.NonEmpty
11 (Function)Algebra.Graph.Undirected
rightAdjacencyListAlgebra.Graph.Bipartite.AdjacencyMap
rightAdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMap
rightVertexAlgebra.Graph.Bipartite.AdjacencyMap
rightVertexCountAlgebra.Graph.Bipartite.AdjacencyMap
rightVertexListAlgebra.Graph.Bipartite.AdjacencyMap
rightVertexSetAlgebra.Graph.Bipartite.AdjacencyMap
scc 
1 (Function)Algebra.Graph.AdjacencyMap.Algorithm
2 (Function)Algebra.Graph.Acyclic.AdjacencyMap
3 (Function)Data.Graph.Typed
scotRailAlgebra.Graph.Labelled.Example.Network
SemiringAlgebra.Graph.Label
ShortestPathAlgebra.Graph.Label
shrinkAlgebra.Graph.Acyclic.AdjacencyMap
simplify 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.NonEmpty
size 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.Labelled
3 (Function)Algebra.Graph.NonEmpty
4 (Function)Algebra.Graph.Undirected
skeletonAlgebra.Graph.Labelled.AdjacencyMap
sparsify 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.NonEmpty
sparsifyKL 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.NonEmpty
splitVertex 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.HigherKinded.Class
splitVertex1Algebra.Graph.NonEmpty
star 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Label
7 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.NonEmpty
11 (Function)Algebra.Graph.Undirected
12 (Function)Algebra.Graph.Class
stars 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.Undirected
stars1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
StarSemiringAlgebra.Graph.Label
StateAlgebra.Graph.Labelled.Example.Automaton
Style 
1 (Type/Class)Algebra.Graph.Export.Dot
2 (Data Constructor)Algebra.Graph.Export.Dot
swapAlgebra.Graph.Bipartite.AdjacencyMap
symmetricClosure 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph.Labelled.AdjacencyMap
4 (Function)Algebra.Graph.Labelled
5 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
6 (Function)Algebra.Graph.Relation
TeaAlgebra.Graph.Labelled.Example.Automaton
toAcyclicAlgebra.Graph.Acyclic.AdjacencyMap
toAcyclicOrdAlgebra.Graph.Acyclic.AdjacencyMap
toAdjacencyIntMapAlgebra.Graph.ToGraph
toAdjacencyIntMapTransposeAlgebra.Graph.ToGraph
toAdjacencyMapAlgebra.Graph.ToGraph
toAdjacencyMapTransposeAlgebra.Graph.ToGraph
toBipartiteAlgebra.Graph.Bipartite.AdjacencyMap
toBipartiteWithAlgebra.Graph.Bipartite.AdjacencyMap
ToGraphAlgebra.Graph.ToGraph
toGraphAlgebra.Graph.ToGraph
toGraphKLData.Graph.Typed
toNonEmpty 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
topSort 
1 (Function)Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Function)Algebra.Graph.AdjacencyMap.Algorithm
3 (Function)Algebra.Graph.Acyclic.AdjacencyMap
4 (Function)Algebra.Graph.ToGraph
5 (Function)Data.Graph.Typed
toRelation 
1 (Function)Algebra.Graph.Undirected
2 (Function)Algebra.Graph.Relation.Transitive
3 (Function)Algebra.Graph.Relation.Reflexive
4 (Function)Algebra.Graph.Relation.Preorder
torus 
1 (Function)Algebra.Graph
2 (Function)Algebra.Graph.HigherKinded.Class
torus1Algebra.Graph.NonEmpty
toSymmetricAlgebra.Graph.Relation.Symmetric
toUndirectedAlgebra.Graph.Undirected
ToVertexAlgebra.Graph.ToGraph
toVertexKLData.Graph.Typed
Transitive 
1 (Type/Class)Algebra.Graph.HigherKinded.Class
2 (Type/Class)Algebra.Graph.Class
transitiveClosure 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph.Labelled.AdjacencyMap
4 (Function)Algebra.Graph.Labelled
5 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
6 (Function)Algebra.Graph.Acyclic.AdjacencyMap
7 (Function)Algebra.Graph.Relation
TransitiveRelationAlgebra.Graph.Relation.Transitive
transpose 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Labelled.AdjacencyMap
5 (Function)Algebra.Graph.Labelled
6 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.NonEmpty
tree 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
6 (Function)Algebra.Graph.Relation
7 (Function)Algebra.Graph.Relation.Symmetric
8 (Function)Algebra.Graph.NonEmpty
9 (Function)Algebra.Graph.Undirected
10 (Function)Algebra.Graph.Class
Undirected 
1 (Type/Class)Algebra.Graph.HigherKinded.Class
2 (Type/Class)Algebra.Graph.Class
unionAlgebra.Graph.Acyclic.AdjacencyMap
UnlabelledGraphAlgebra.Graph.Labelled
unlinesAlgebra.Graph.Export
unsafeFiniteAlgebra.Graph.Label
Vertex 
1 (Data Constructor)Algebra.Graph
2 (Data Constructor)Algebra.Graph.Labelled
3 (Data Constructor)Algebra.Graph.NonEmpty
4 (Type/Class)Algebra.Graph.Class
vertex 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
9 (Function)Algebra.Graph.Acyclic.AdjacencyMap
10 (Function)Algebra.Graph.Relation
11 (Function)Algebra.Graph.Relation.Symmetric
12 (Function)Algebra.Graph.NonEmpty
13 (Function)Algebra.Graph.Undirected
14 (Function)Algebra.Graph.Class
vertexAttributesAlgebra.Graph.Export.Dot
vertexCount 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.ToGraph
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
VertexCoverAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
vertexCoverSizeAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
vertexFocusAlgebra.Graph.Internal
vertexIntSet 
1 (Function)Algebra.Graph.AdjacencyIntMap
2 (Function)Algebra.Graph.ToGraph
vertexList 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.Bipartite.AdjacencyMap
5 (Function)Algebra.Graph.Labelled.AdjacencyMap
6 (Function)Algebra.Graph.Labelled
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.ToGraph
11 (Function)Algebra.Graph.Undirected
vertexList1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
vertexNameAlgebra.Graph.Export.Dot
vertexSet 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph
3 (Function)Algebra.Graph.Bipartite.AdjacencyMap
4 (Function)Algebra.Graph.Labelled.AdjacencyMap
5 (Function)Algebra.Graph.Labelled
6 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
7 (Function)Algebra.Graph.Acyclic.AdjacencyMap
8 (Function)Algebra.Graph.Relation
9 (Function)Algebra.Graph.Relation.Symmetric
10 (Function)Algebra.Graph.ToGraph
11 (Function)Algebra.Graph.NonEmpty
12 (Function)Algebra.Graph.Undirected
vertices 
1 (Function)Algebra.Graph.AdjacencyMap
2 (Function)Algebra.Graph.AdjacencyIntMap
3 (Function)Algebra.Graph
4 (Function)Algebra.Graph.HigherKinded.Class
5 (Function)Algebra.Graph.Bipartite.AdjacencyMap
6 (Function)Algebra.Graph.Labelled.AdjacencyMap
7 (Function)Algebra.Graph.Labelled
8 (Function)Algebra.Graph.Acyclic.AdjacencyMap
9 (Function)Algebra.Graph.Relation
10 (Function)Algebra.Graph.Relation.Symmetric
11 (Function)Algebra.Graph.Undirected
12 (Function)Algebra.Graph.Class
vertices1 
1 (Function)Algebra.Graph.NonEmpty.AdjacencyMap
2 (Function)Algebra.Graph.NonEmpty
vsAlgebra.Graph.Internal
WidestPathAlgebra.Graph.Label
zeroAlgebra.Graph.Label