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

Index - I

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