Algebraic graphs
Fixing the lower bound of base
, see #284.
Monoid
and Semigroup
instances.Undirected
component in Bipartite.Undirected.AdjacencyMap
.Export.Dot
.IsString
instances.Bipartite.Undirected.AdjacencyMap
.Bipartite.Undirected.AdjacencyMap
.Algebra.Graph.Undirected
.Acyclic.AdjacencyMap
.induceJust
and induceJust1
.fromNonEmpty
to NonEmpty.AdjacencyMap
.fromAdjacencyMap
to AdjacencyIntMap
.Internal
modules for AdjacencyIntMap
, AdjacencyMap
,
Labelled.AdjacencyMap
, NonEmpty.AdjacencyMap
, Relation
and
Relation.Symmetric
.Algebra.Graph.AdjacencyMap.box
.base-compat
and base-orphans
.Algebra.Graph.Fold
.ToGraph.size
. Demote ToGraph.adjacencyMap
,
ToGraph.adjacencyIntMap
, ToGraph.adjacencyMapTranspose
and
ToGraph.adjacencyIntMapTranspose
to functions.Generic
and NFData
for Algebra.Graph
and Algebra.Graph.Labelled
.inspection-testing
library.preorderClosure
to closure
.Relation.compose
.Show
instances.fromAdjacencySets
and fromAdjacencyIntSets
.Eq
instance on the string type when exporting graphs.Algebra.Graph.NonEmpty.NonEmptyGraph
to Algebra.Graph.NonEmpty.Graph
.Algebra.Graph.NonEmpty.AdjacencyMap
.vertexIntSet
from the API of basic graph data types. Also
remove Algebra.Graph.adjacencyMap
and Algebra.Graph.adjacencyIntMap
.
This functionality is still available from the type class ToGraph
.Ord
instance.Foldable
and Traversable
instances.Labelled.AdjacencyMap
.