Indexalgebraic-graphs-0.8
A–Z
- -<Algebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMap
- :=Algebra.Graph.Export.Dot
- <+>Algebra.Graph.ExportAlgebra.Graph.Label
- <.>Algebra.Graph.Label
- ===Algebra.GraphAlgebra.Graph.NonEmpty
- >*<Algebra.Graph.Example.Todo
- >-Algebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMap
- AberdeenAlgebra.Graph.Labelled.Example.Network
- AdjacencyIntMapAlgebra.Graph.AdjacencyIntMap
- adjacencyIntMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.ToGraph
- adjacencyIntMapTransposeAlgebra.Graph.ToGraph
- adjacencyListAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- adjacencyListAlgebra.Graph.ToGraph
- AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMap
- AdjacencyMapAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMap
- adjacencyMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.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
- bfsAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.Algorithm
- bfsForestAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.Algorithm
- bicliqueAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- biclique1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- bimapAlgebra.Graph.Bipartite.AdjacencyMap
- boxAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.NonEmpty
- boxWithAlgebra.Graph.Bipartite.AdjacencyMap
- bracketsAlgebra.Graph.Export
- buildgAlgebra.GraphAlgebra.Graph.Labelled
- CancelAlgebra.Graph.Labelled.Example.Automaton
- CapacityAlgebra.Graph.Label
- capacityAlgebra.Graph.Label
- cartesianProductWithAlgebra.Graph.Internal
- ChoiceAlgebra.Graph.Labelled.Example.Automaton
- circuitAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- circuit1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- CityAlgebra.Graph.Labelled.Example.Network
- cliqueAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- clique1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- closureAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.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
- composeAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Relation
- ConnectAlgebra.GraphAlgebra.Graph.LabelledAlgebra.Graph.NonEmpty
- connectAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- connectAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.Class
- connectFociAlgebra.Graph.Internal
- connectsAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- connects1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- ConsAlgebra.Graph.Bipartite.AdjacencyMap
- consistentAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.Symmetric
- consistentMatchingAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- ContextAlgebra.GraphAlgebra.Graph.Labelled
- ContextAlgebra.GraphAlgebra.Graph.Labelled
- contextAlgebra.GraphAlgebra.Graph.Labelled
- CountAlgebra.Graph.Label
- countAlgebra.Graph.Label
- CountShortestPathsAlgebra.Graph.Label
- CycleAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.Algorithm
- deBruijnAlgebra.GraphAlgebra.Graph.HigherKinded.Class
- defaultEdgeAttributesAlgebra.Graph.Export.Dot
- defaultStyleAlgebra.Graph.Export.Dot
- defaultStyleViaShowAlgebra.Graph.Export.Dot
- defaultVertexAttributesAlgebra.Graph.Export.Dot
- detectPartsAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- dfsAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.AlgorithmData.Graph.Typed
- dfsAlgebra.Graph.ToGraph
- dfsForestAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.AlgorithmData.Graph.Typed
- dfsForestAlgebra.Graph.ToGraph
- dfsForestFromAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.AlgorithmData.Graph.Typed
- dfsForestFromAlgebra.Graph.ToGraph
- 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
- edgeAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- edgeAttributesAlgebra.Graph.Export.Dot
- edgeCountAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- edgeCountAlgebra.Graph.ToGraph
- edgeLabelAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMap
- edgeListAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- edgeListAlgebra.Graph.ToGraph
- edgesAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- edges1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- edgeSetAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- edgeSetAlgebra.Graph.ToGraph
- EdinburghAlgebra.Graph.Labelled.Example.Network
- emapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMap
- EmptyAlgebra.GraphAlgebra.Graph.Labelled
- emptyAlgebra.Graph.HigherKinded.Class
- emptyAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- emptyAlgebra.Graph.Class
- emptyFocusAlgebra.Graph.Internal
- evenListAlgebra.Graph.Bipartite.AdjacencyMap
- exportAlgebra.Graph.ExportAlgebra.Graph.Export.Dot
- exportAsIsAlgebra.Graph.Export.Dot
- exportViaShowAlgebra.Graph.Export.Dot
- finiteAlgebra.Graph.Label
- finiteWordAlgebra.Graph.Label
- FocusAlgebra.Graph.Internal
- FocusAlgebra.Graph.Internal
- foldgAlgebra.GraphAlgebra.Graph.LabelledAlgebra.Graph.Undirected
- foldgAlgebra.Graph.ToGraph
- foldg1Algebra.Graph.NonEmpty
- foldr1SafeAlgebra.Graph.Internal
- forestAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- fromAcyclicAlgebra.Graph.Acyclic.AdjacencyMap
- fromAdjacencyIntMapData.Graph.Typed
- fromAdjacencyIntSetsAlgebra.Graph.AdjacencyIntMap
- fromAdjacencyMapAlgebra.Graph.AdjacencyIntMapData.Graph.Typed
- fromAdjacencyMapsAlgebra.Graph.Labelled.AdjacencyMap
- fromAdjacencySetsAlgebra.Graph.AdjacencyMap
- fromBipartiteAlgebra.Graph.Bipartite.AdjacencyMap
- fromBipartiteWithAlgebra.Graph.Bipartite.AdjacencyMap
- fromNonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- fromRelationAlgebra.Graph.Relation.PreorderAlgebra.Graph.Relation.ReflexiveAlgebra.Graph.Relation.Transitive
- 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
- gmapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.Symmetric
- GraphAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.Class
- GraphAlgebra.GraphAlgebra.Graph.LabelledAlgebra.Graph.NonEmpty
- GraphAlgebra.Graph.Undirected
- graphAttributesAlgebra.Graph.Export.Dot
- GraphKLData.Graph.Typed
- GraphKLData.Graph.Typed
- graphNameAlgebra.Graph.Export.Dot
- hasEdgeAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- hasEdgeAlgebra.Graph.ToGraph
- hasLeftVertexAlgebra.Graph.Bipartite.AdjacencyMap
- hasRightVertexAlgebra.Graph.Bipartite.AdjacencyMap
- hasVertexAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- hasVertexAlgebra.Graph.ToGraph
- highAlgebra.Graph.Example.Todo
- holidayAlgebra.Graph.Example.Todo
- indentAlgebra.Graph.Export
- IndependentSetAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- independentSetSizeAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- induceAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- induce1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- induceJustAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- induceJust1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- infiniteAlgebra.Graph.Label
- inputsAlgebra.GraphAlgebra.Graph.Labelled
- isAlgebra.Graph.Internal
- isAcyclicAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.Algorithm
- isAcyclicAlgebra.Graph.ToGraph
- isDfsForestOfAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.Algorithm
- isDfsForestOfAlgebra.Graph.ToGraph
- isEmptyAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ExportAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- isEmptyAlgebra.Graph.ToGraph
- isIndependentSetOfAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- isMatchingOfAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- isSubgraphOfAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- isTopSortOfAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.Algorithm
- isTopSortOfAlgebra.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
- ListAlgebra.Graph.Bipartite.AdjacencyMap
- ListAlgebra.Graph.Internal
- literalAlgebra.Graph.Export
- LondonAlgebra.Graph.Labelled.Example.Network
- lowAlgebra.Graph.Example.Todo
- 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
- mergeVerticesAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- meshAlgebra.GraphAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.HigherKinded.Class
- mesh1Algebra.Graph.NonEmpty
- MinimumAlgebra.Graph.Label
- minVertexCoverAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- neighboursAlgebra.Graph.Relation.SymmetricAlgebra.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
- OptimumAlgebra.Graph.Label
- OptimumAlgebra.Graph.Label
- osAlgebra.Graph.Internal
- outputsAlgebra.GraphAlgebra.Graph.Labelled
- OverlayAlgebra.GraphAlgebra.Graph.NonEmpty
- overlayAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- overlayAlgebra.Graph.Class
- overlay1Algebra.Graph.NonEmpty
- overlayFociAlgebra.Graph.Internal
- overlaysAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- overlays1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- pairOfLeftAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- pairOfRightAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- PathAlgebra.Graph.Label
- pathAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- path1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- PayAlgebra.Graph.Labelled.Example.Automaton
- PaymentAlgebra.Graph.Labelled.Example.Automaton
- postIntSetAlgebra.Graph.AdjacencyIntMap
- postIntSetAlgebra.Graph.ToGraph
- postSetAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.Relation
- postSetAlgebra.Graph.ToGraph
- PowerSetAlgebra.Graph.Label
- PowerSetAlgebra.Graph.Label
- preambleAlgebra.Graph.Export.Dot
- preIntSetAlgebra.Graph.AdjacencyIntMap
- preIntSetAlgebra.Graph.ToGraph
- PreorderAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.Class
- PreorderRelationAlgebra.Graph.Relation.Preorder
- preSetAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.Relation
- preSetAlgebra.Graph.ToGraph
- priorityAlgebra.Graph.Example.Todo
- QuotingAlgebra.Graph.Export.Dot
- reachabilityAlgebra.Graph.Labelled.Example.Automaton
- reachableAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.Algorithm
- reachableAlgebra.Graph.ToGraph
- ReflexiveAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.Class
- reflexiveClosureAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.Relation
- ReflexiveRelationAlgebra.Graph.Relation.Reflexive
- RegularExpressionAlgebra.Graph.Label
- RelationAlgebra.Graph.Relation
- RelationAlgebra.Graph.Relation.Symmetric
- relationAlgebra.Graph.Relation
- removeEdgeAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- removeLeftVertexAlgebra.Graph.Bipartite.AdjacencyMap
- removeRightVertexAlgebra.Graph.Bipartite.AdjacencyMap
- removeVertexAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- removeVertex1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- renderAlgebra.Graph.Export
- replaceEdgeAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMap
- replaceVertexAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.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
- sccAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyMap.AlgorithmData.Graph.Typed
- scotRailAlgebra.Graph.Labelled.Example.Network
- SemiringAlgebra.Graph.Label
- shoppingAlgebra.Graph.Example.Todo
- ShortestPathAlgebra.Graph.Label
- shrinkAlgebra.Graph.Acyclic.AdjacencyMap
- simplifyAlgebra.GraphAlgebra.Graph.NonEmpty
- sizeAlgebra.GraphAlgebra.Graph.LabelledAlgebra.Graph.NonEmptyAlgebra.Graph.Undirected
- skeletonAlgebra.Graph.Labelled.AdjacencyMap
- sparsifyAlgebra.GraphAlgebra.Graph.NonEmpty
- sparsifyKLAlgebra.GraphAlgebra.Graph.NonEmpty
- splitVertexAlgebra.GraphAlgebra.Graph.HigherKinded.Class
- splitVertex1Algebra.Graph.NonEmpty
- starAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- starAlgebra.Graph.Label
- starsAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- stars1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- StarSemiringAlgebra.Graph.Label
- StateAlgebra.Graph.Labelled.Example.Automaton
- StyleAlgebra.Graph.Export.Dot
- StyleAlgebra.Graph.Export.Dot
- swapAlgebra.Graph.Bipartite.AdjacencyMap
- symbolAlgebra.Graph.Label
- symbolsAlgebra.Graph.Label
- symmetricClosureAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.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
- TodoAlgebra.Graph.Example.Todo
- todoAlgebra.Graph.Example.Todo
- ToGraphAlgebra.Graph.ToGraph
- toGraphAlgebra.Graph.ToGraph
- toGraphKLData.Graph.Typed
- toNonEmptyAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- topSortAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMap.AlgorithmAlgebra.Graph.AdjacencyMap.AlgorithmData.Graph.Typed
- topSortAlgebra.Graph.ToGraph
- toRelationAlgebra.Graph.Relation.PreorderAlgebra.Graph.Relation.ReflexiveAlgebra.Graph.Relation.TransitiveAlgebra.Graph.Undirected
- torusAlgebra.GraphAlgebra.Graph.HigherKinded.Class
- torus1Algebra.Graph.NonEmpty
- toSymmetricAlgebra.Graph.Relation.Symmetric
- toUndirectedAlgebra.Graph.Undirected
- ToVertexAlgebra.Graph.ToGraph
- toVertexKLData.Graph.Typed
- TransitiveAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.Class
- transitiveClosureAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.Relation
- TransitiveRelationAlgebra.Graph.Relation.Transitive
- transposeAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.Relation
- treeAlgebra.GraphAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- UndirectedAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.Class
- unionAlgebra.Graph.Acyclic.AdjacencyMap
- UnlabelledGraphAlgebra.Graph.Labelled
- unlinesAlgebra.Graph.Export
- unsafeFiniteAlgebra.Graph.Label
- VertexAlgebra.Graph.Class
- VertexAlgebra.GraphAlgebra.Graph.LabelledAlgebra.Graph.NonEmpty
- vertexAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- vertexAlgebra.Graph.Class
- vertexAttributesAlgebra.Graph.Export.Dot
- vertexCountAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- vertexCountAlgebra.Graph.ToGraph
- VertexCoverAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- vertexCoverSizeAlgebra.Graph.Bipartite.AdjacencyMap.Algorithm
- vertexFocusAlgebra.Graph.Internal
- vertexIntSetAlgebra.Graph.AdjacencyIntMap
- vertexIntSetAlgebra.Graph.ToGraph
- vertexListAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- vertexListAlgebra.Graph.ToGraph
- vertexList1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- vertexNameAlgebra.Graph.Export.Dot
- vertexSetAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- vertexSetAlgebra.Graph.ToGraph
- verticesAlgebra.GraphAlgebra.Graph.Acyclic.AdjacencyMapAlgebra.Graph.AdjacencyIntMapAlgebra.Graph.AdjacencyMapAlgebra.Graph.Bipartite.AdjacencyMapAlgebra.Graph.ClassAlgebra.Graph.HigherKinded.ClassAlgebra.Graph.LabelledAlgebra.Graph.Labelled.AdjacencyMapAlgebra.Graph.RelationAlgebra.Graph.Relation.SymmetricAlgebra.Graph.Undirected
- vertices1Algebra.Graph.NonEmptyAlgebra.Graph.NonEmpty.AdjacencyMap
- vsAlgebra.Graph.Internal
- WidestPathAlgebra.Graph.Label
- zeroAlgebra.Graph.Label
- ~*~Algebra.Graph.Example.Todo