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

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

Index - C

Cancel | Algebra.Graph.Labelled.Example.Automaton
Capacity | Algebra.Graph.Label
capacity | Algebra.Graph.Label
cartesianProductWith | Algebra.Graph.Internal
Choice | Algebra.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
City | Algebra.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.NonEmpty.AdjacencyMap
4 (Function) | Algebra.Graph.Relation
5 (Function) | Algebra.Graph.Labelled.AdjacencyMap
6 (Function) | Algebra.Graph.Labelled
coerce00 | Algebra.Graph.Internal
coerce01 | Algebra.Graph.Internal
coerce10 | Algebra.Graph.Internal
coerce11 | Algebra.Graph.Internal
coerce20 | Algebra.Graph.Internal
coerce21 | Algebra.Graph.Internal
Coffee | Algebra.Graph.Labelled.Example.Automaton
coffeeTeaAutomaton | Algebra.Graph.Labelled.Example.Automaton
complement | Algebra.Graph.Undirected
Complete | Algebra.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.NonEmpty
3 (Data Constructor) | Algebra.Graph.Labelled
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.NonEmpty.AdjacencyMap
7 (Function) | Algebra.Graph.Relation
8 (Function) | Algebra.Graph.Relation.Symmetric
9 (Function) | Algebra.Graph.NonEmpty
10 (Function) | Algebra.Graph.Labelled.AdjacencyMap
11 (Function) | Algebra.Graph.Labelled
12 (Function) | Algebra.Graph.Undirected
13 (Function) | Algebra.Graph.Class
connectFoci | Algebra.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
Cons | Algebra.Graph.Bipartite.AdjacencyMap
consistent |
1 (Function) | Algebra.Graph.AdjacencyMap
2 (Function) | Algebra.Graph.AdjacencyIntMap
3 (Function) | Algebra.Graph.Bipartite.AdjacencyMap
4 (Function) | Algebra.Graph.NonEmpty.AdjacencyMap
5 (Function) | Algebra.Graph.Acyclic.AdjacencyMap
6 (Function) | Algebra.Graph.Relation
7 (Function) | Algebra.Graph.Relation.Symmetric
8 (Function) | Algebra.Graph.Labelled.AdjacencyMap
consistentMatching | Algebra.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
Count | Algebra.Graph.Label
count | Algebra.Graph.Label
CountShortestPaths | Algebra.Graph.Label
Cycle |
1 (Type/Class) | Algebra.Graph.AdjacencyIntMap.Algorithm
2 (Type/Class) | Algebra.Graph.AdjacencyMap.Algorithm