cifl-math-library-1.1.1.0: Math libraries
Safe HaskellSafe
LanguageHaskell2010

Math.Graph.InGraphA

Documentation

newtype InGraphA (m :: * -> * -> *) a b c Source #

Constructors

InGraphA 

Fields

Instances

Instances details
Category (InGraphA m a :: Type -> Type -> Type) Source # 
Instance details

Defined in Math.Graph.InGraphA

Methods

id :: forall (a0 :: k). InGraphA m a a0 a0 #

(.) :: forall (b :: k) (c :: k) (a0 :: k). InGraphA m a b c -> InGraphA m a a0 b -> InGraphA m a a0 c #

Monoid (m Bool Bool) => MonoidArrow (InGraphA m a :: Type -> Type -> Type) (m Bool Bool) (a :: Type) Source # 
Instance details

Defined in Math.Graph.InGraphA

Methods

monoidA :: m Bool Bool -> InGraphA m a a a Source #

Arrow (InGraphA m a) Source # 
Instance details

Defined in Math.Graph.InGraphA

Methods

arr :: (b -> c) -> InGraphA m a b c #

first :: InGraphA m a b c -> InGraphA m a (b, d) (c, d) #

second :: InGraphA m a b c -> InGraphA m a (d, b) (d, c) #

(***) :: InGraphA m a b c -> InGraphA m a b' c' -> InGraphA m a (b, b') (c, c') #

(&&&) :: InGraphA m a b c -> InGraphA m a b c' -> InGraphA m a b (c, c') #

ArrowApply (InGraphA m a) Source # 
Instance details

Defined in Math.Graph.InGraphA

Methods

app :: InGraphA m a (InGraphA m a b c, b) c #

(Ord a, GraphMonoid m Bool) => GraphArrow (InGraphA m a) a Source # 
Instance details

Defined in Math.Graph.InGraphA

Methods

gisVertexA :: InGraphA m a a Bool Source #

gsourceA :: InGraphA m a a a Source #

gtargetA :: InGraphA m a a a Source #

gelementsA :: InGraphA m a () (Set a) Source #

gverticesA :: InGraphA m a () (Set a) Source #

gedgesA :: InGraphA m a () (Set a) Source #

gedgesStartingFromA :: InGraphA m a a (Set a) Source #

gedgesEndingToA :: InGraphA m a a (Set a) Source #

glinksA :: InGraphA m a () (Set (a, a, a)) Source #

(Ord a, ReversibleGraphMonoid m Bool) => ReversibleGraphArrow (InGraphA m a) a Source # 
Instance details

Defined in Math.Graph.InGraphA

Methods

ginverseA :: InGraphA m a a a Source #

greversibleLinksA :: InGraphA m a () (Set ((a, a), (a, a))) Source #

ArrowReader (Graph m a) (InGraphA m a) Source # 
Instance details

Defined in Math.Graph.InGraphA

Methods

readState :: InGraphA m a b (Graph m a)

newReader :: InGraphA m a e b -> InGraphA m a (e, Graph m a) b

inGraphA :: InGraphA m a b c -> Graph m a -> b -> c Source #

actSetA :: Ord a => InGraphA m a (Set a, m Bool Bool) (Set a) Source #

actA :: InGraphA m a (a, m Bool Bool) a Source #

elementsA :: (GraphMonoid m Bool, Ord a) => InGraphA m a () (Set a) Source #

verticesA :: (GraphMonoid m Bool, Ord a) => InGraphA m a () (Set a) Source #

edgesA :: (GraphMonoid m Bool, Ord a) => InGraphA m a () (Set a) Source #

linksA :: (GraphMonoid m Bool, Ord e) => InGraphA m e () (Set (e, e, e)) Source #

edgesStartingFromA :: (GraphMonoid m Bool, Ord a) => InGraphA m a a (Set a) Source #

edgesEndingToA :: (GraphMonoid m Bool, Ord a) => InGraphA m a a (Set a) Source #

reversibleLinksA :: (Ord a, ReversibleGraphMonoid m Bool) => InGraphA m a () (Set ((a, a), (a, a))) Source #

sourceA :: GraphMonoid m Bool => InGraphA m a a a Source #

targetA :: GraphMonoid m Bool => InGraphA m a a a Source #

inverseA :: ReversibleGraphMonoid m Bool => InGraphA m a a a Source #

edgeNodesA :: GraphMonoid m Bool => InGraphA m a a (a, a) Source #

isVertexA :: (Eq a, GraphMonoid m Bool) => InGraphA m a a Bool Source #

isLoopA :: (Eq a, GraphMonoid m Bool) => InGraphA m a a Bool Source #

isOneLaneLoopA :: (Eq a, ReversibleGraphMonoid m Bool) => InGraphA m a a Bool Source #

isEdgeA :: (Eq a, GraphMonoid m Bool) => InGraphA m a (a, a, a) Bool Source #