Safe Haskell	Safe-Inferred
Language	Haskell2010

Math.Graph.Labeled

Documentation

data LGraph lbl mon a Source #

Constructors

LGraph
Fields lgraph_basegraph :: Graph mon a lgraph_labels :: a :==: lbl

Instances

Instances details

(Monad m, Ord e, GraphMonoid mon Bool) => GraphMonad (ReaderT (LGraph lbl mon e) m) e Source #
Instance details Defined in Math.Graph.Labeled Methods gisVertex :: e -> ReaderT (LGraph lbl mon e) m Bool Source # gsource :: e -> ReaderT (LGraph lbl mon e) m e Source # gtarget :: e -> ReaderT (LGraph lbl mon e) m e Source # gelements :: ReaderT (LGraph lbl mon e) m (Set e) Source # gvertices :: ReaderT (LGraph lbl mon e) m (Set e) Source # gedges :: ReaderT (LGraph lbl mon e) m (Set e) Source # gedgesStartingFrom :: e -> ReaderT (LGraph lbl mon e) m (Set e) Source # gedgesEndingTo :: e -> ReaderT (LGraph lbl mon e) m (Set e) Source # glinks :: ReaderT (LGraph lbl mon e) m (Set (e, e, e)) Source # gloops :: ReaderT (LGraph lbl mon e) m (Set e) Source # gisLoop :: e -> ReaderT (LGraph lbl mon e) m Bool Source # gisEdgeBetween :: e -> e -> e -> ReaderT (LGraph lbl mon e) m Bool Source #
(Monad m, Ord e, ReversibleGraphMonoid mon Bool) => ReversibleGraphMonad (ReaderT (LGraph lbl mon e) m) e Source #
Instance details Defined in Math.Graph.Labeled Methods ginverse :: e -> ReaderT (LGraph lbl mon e) m e Source # greversibleLinks :: ReaderT (LGraph lbl mon e) m (Set ((e, e), (e, e))) Source # goneLaneLoops :: ReaderT (LGraph lbl mon e) m (Set e) Source # gisOneLaneLoop :: e -> ReaderT (LGraph lbl mon e) m Bool Source #
(Monad m, Ord e, GraphMonoid mon Bool) => LabeledGraphMonad (ReaderT (LGraph lbl mon e) m) lbl e Source #
Instance details Defined in Math.Graph.Labeled Methods glabelOf :: e -> ReaderT (LGraph lbl mon e) m lbl Source # gfind :: lbl -> ReaderT (LGraph lbl mon e) m e Source #

labelsFromMaps :: (Ord a, Ord lbl, MonadFail m) => Map lbl a -> Map a lbl -> Graph mon a -> m (LGraph lbl mon a) Source #

labelOf :: LGraph lbl m a -> a -> lbl Source #

elementByLabel :: LGraph lbl m a -> lbl -> a Source #

data InLGraphM mon lbl e m a Source #

Constructors

InLGraphM
Fields runInLGraphM :: ReaderT (LGraph lbl mon e) m a

Instances

Instances details

MonadTrans (InLGraphM mon lbl e) Source #
Instance details Defined in Math.Graph.Labeled Methods lift :: Monad m => m a -> InLGraphM mon lbl e m a #
Applicative m => Applicative (InLGraphM mon lbl e m) Source #
Instance details Defined in Math.Graph.Labeled Methods pure :: a -> InLGraphM mon lbl e m a # (<>) :: InLGraphM mon lbl e m (a -> b) -> InLGraphM mon lbl e m a -> InLGraphM mon lbl e m b # liftA2 :: (a -> b -> c) -> InLGraphM mon lbl e m a -> InLGraphM mon lbl e m b -> InLGraphM mon lbl e m c # (>) :: InLGraphM mon lbl e m a -> InLGraphM mon lbl e m b -> InLGraphM mon lbl e m b # (<*) :: InLGraphM mon lbl e m a -> InLGraphM mon lbl e m b -> InLGraphM mon lbl e m a #
Functor m => Functor (InLGraphM mon lbl e m) Source #
Instance details Defined in Math.Graph.Labeled Methods fmap :: (a -> b) -> InLGraphM mon lbl e m a -> InLGraphM mon lbl e m b # (<$) :: a -> InLGraphM mon lbl e m b -> InLGraphM mon lbl e m a #
Monad m => Monad (InLGraphM mon lbl e m) Source #
Instance details Defined in Math.Graph.Labeled Methods (>>=) :: InLGraphM mon lbl e m a -> (a -> InLGraphM mon lbl e m b) -> InLGraphM mon lbl e m b # (>>) :: InLGraphM mon lbl e m a -> InLGraphM mon lbl e m b -> InLGraphM mon lbl e m b # return :: a -> InLGraphM mon lbl e m a #
(Ord e, Monad m, GraphMonoid mon Bool) => GraphMonad (InLGraphM mon lbl e m) e Source #
Instance details Defined in Math.Graph.Labeled Methods gisVertex :: e -> InLGraphM mon lbl e m Bool Source # gsource :: e -> InLGraphM mon lbl e m e Source # gtarget :: e -> InLGraphM mon lbl e m e Source # gelements :: InLGraphM mon lbl e m (Set e) Source # gvertices :: InLGraphM mon lbl e m (Set e) Source # gedges :: InLGraphM mon lbl e m (Set e) Source # gedgesStartingFrom :: e -> InLGraphM mon lbl e m (Set e) Source # gedgesEndingTo :: e -> InLGraphM mon lbl e m (Set e) Source # glinks :: InLGraphM mon lbl e m (Set (e, e, e)) Source # gloops :: InLGraphM mon lbl e m (Set e) Source # gisLoop :: e -> InLGraphM mon lbl e m Bool Source # gisEdgeBetween :: e -> e -> e -> InLGraphM mon lbl e m Bool Source #
(Ord e, Monad m, ReversibleGraphMonoid mon Bool) => ReversibleGraphMonad (InLGraphM mon lbl e m) e Source #
Instance details Defined in Math.Graph.Labeled Methods ginverse :: e -> InLGraphM mon lbl e m e Source # greversibleLinks :: InLGraphM mon lbl e m (Set ((e, e), (e, e))) Source # goneLaneLoops :: InLGraphM mon lbl e m (Set e) Source # gisOneLaneLoop :: e -> InLGraphM mon lbl e m Bool Source #
(Monad m, Ord e, GraphMonoid mon Bool) => LabeledGraphMonad (InLGraphM mon lbl e m) lbl e Source #
Instance details Defined in Math.Graph.Labeled Methods glabelOf :: e -> InLGraphM mon lbl e m lbl Source # gfind :: lbl -> InLGraphM mon lbl e m e Source #

liftReaderLGraph :: Monad m => InLGraphM mon lbl e m a -> ReaderT (LGraph lbl mon e) m a Source #

inLabeledGraphM :: LGraph lbl mon e -> InLGraphM mon lbl e m a -> m a Source #

liftLabelM :: Monad m => InGraphM mon e m a -> InLGraphM mon lbl e m a Source #