| Tea | Algebra.Graph.Labelled.Example.Automaton |
| toAcyclic | Algebra.Graph.Acyclic.AdjacencyMap |
| toAcyclicOrd | Algebra.Graph.Acyclic.AdjacencyMap |
| toAdjacencyIntMap | Algebra.Graph.ToGraph |
| toAdjacencyIntMapTranspose | Algebra.Graph.ToGraph |
| toAdjacencyMap | Algebra.Graph.ToGraph |
| toAdjacencyMapTranspose | Algebra.Graph.ToGraph |
| toBipartite | Algebra.Graph.Bipartite.Undirected.AdjacencyMap |
| toBipartiteWith | Algebra.Graph.Bipartite.Undirected.AdjacencyMap |
| ToGraph | Algebra.Graph.ToGraph |
| toGraph | Algebra.Graph.ToGraph |
| toGraphKL | Data.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 |
| torus1 | Algebra.Graph.NonEmpty |
| toSymmetric | Algebra.Graph.Relation.Symmetric |
| toUndirected | Algebra.Graph.Undirected |
| ToVertex | Algebra.Graph.ToGraph |
| toVertexKL | Data.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 |
| TransitiveRelation | Algebra.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 |