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

Copyright (c) Andrey Mokhov 2016-2017 MIT (see the file LICENSE) andrey.mokhov@gmail.com experimental None Haskell2010

Algebra.Graph.Relation.Preorder

Contents

Description

An abstract implementation of preorder relations. Use Algebra.Graph.Class for polymorphic construction and manipulation.

Synopsis

# Data structure

The PreorderRelation data type represents a binary relation that is both reflexive and transitive. Preorders satisfy all laws of the Preorder type class and, in particular, the self-loop axiom:

vertex x == vertex x * vertex x

and the closure axiom:

y /= empty ==> x * y + x * z + y * z == x * y + y * z

For example, the following holds:

path xs == (clique xs :: PreorderRelation Int)

The Show instance produces reflexively and transitively closed expressions:

show (1             :: PreorderRelation Int) == "edge 1 1"
show (1 * 2         :: PreorderRelation Int) == "edges [(1,1),(1,2),(2,2)]"
show (1 * 2 + 2 * 3 :: PreorderRelation Int) == "edges [(1,1),(1,2),(1,3),(2,2),(2,3),(3,3)]"

Instances

 Ord a => Eq (PreorderRelation a) Source # Methods (Num a, Ord a) => Num (PreorderRelation a) Source # Methods (Ord a, Show a) => Show (PreorderRelation a) Source # MethodsshowList :: [PreorderRelation a] -> ShowS # Ord a => Preorder (PreorderRelation a) Source # Source # Ord a => Reflexive (PreorderRelation a) Source # Ord a => Graph (PreorderRelation a) Source # Associated Typestype Vertex (PreorderRelation a) :: * Source # Methods type Vertex (PreorderRelation a) Source # type Vertex (PreorderRelation a) = a

Construct a preorder relation from a Relation. Complexity: O(1) time.

toRelation :: Ord a => PreorderRelation a -> Relation a Source #

Extract the underlying relation. Complexity: O(n * m * log(m)) time.