reachability | Algebra.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 |
ReflexiveRelation | Algebra.Graph.Relation.Reflexive |
RegularExpression | Algebra.Graph.Label |
Relation | |
1 (Type/Class) | Algebra.Graph.Relation |
2 (Type/Class) | Algebra.Graph.Relation.Symmetric |
relation | Algebra.Graph.Relation |
removeEdge | |
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.Relation.Symmetric |
10 (Function) | Algebra.Graph.NonEmpty |
11 (Function) | Algebra.Graph.Undirected |
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 |
render | Algebra.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 |
rightAdjacencyMap | Algebra.Graph.Bipartite.Undirected.AdjacencyMap |
rightVertex | Algebra.Graph.Bipartite.Undirected.AdjacencyMap |
rightVertexCount | Algebra.Graph.Bipartite.Undirected.AdjacencyMap |
rightVertexList | Algebra.Graph.Bipartite.Undirected.AdjacencyMap |
rightVertexSet | Algebra.Graph.Bipartite.Undirected.AdjacencyMap |