The ReflexiveRelation data type represents a reflexive binary relation
over a set of elements. Reflexive relations satisfy all laws of the
Reflexive type class and, in particular, the self-loop axiom:
vertex x == vertex x * vertex xThe Show instance produces reflexively closed expressions:
show (1 :: ReflexiveRelation Int) == "edge 1 1"
show (1 * 2 :: ReflexiveRelation Int) == "edges [(1,1),(1,2),(2,2)]"Instances9Eq, Num, Ord, Show, IsString, NFData, …
Ord a => Eq (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.Reflexive(Ord a, Num a) => Num (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.ReflexiveOrd a => Ord (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.Reflexive(Ord a, Show a) => Show (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.ReflexiveIsString a => IsString (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.ReflexiveNFData a => NFData (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.ReflexiveOrd a => Graph (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.ReflexiveOrd a => Reflexive (ReflexiveRelation a)Defined in algebraic-graphs-0.8 · Algebra.Graph.Relation.Reflexivetype Vertex (ReflexiveRelation a) = aDefined in algebraic-graphs-0.8 · Algebra.Graph.Relation.Reflexive