{-# LANGUAGE CPP, TypeFamilies, FlexibleInstances #-}
module Data.Graph.Class.AdjacencyMatrix
( AdjacencyMatrixGraph(..)
, module Data.Graph.Class
) where
import qualified Control.Monad.Trans.State.Strict as Strict
import qualified Control.Monad.Trans.State.Lazy as Lazy
import qualified Control.Monad.Trans.Writer.Strict as Strict
import qualified Control.Monad.Trans.Writer.Lazy as Lazy
import qualified Control.Monad.Trans.RWS.Strict as Strict
import qualified Control.Monad.Trans.RWS.Lazy as Lazy
import Control.Monad.Trans.Reader
import Control.Monad.Trans.Maybe
import Control.Monad.Trans.Identity
#if !(MIN_VERSION_transformers(0,6,0))
import Control.Monad.Trans.Error
#endif
import Control.Monad.Trans.Class
import Data.Functor.Identity
#if __GLASGOW_HASKELL__ < 710
import Data.Monoid
#endif
import Data.Graph.Class
class Graph g => AdjacencyMatrixGraph g where
edge :: Vertex g -> Vertex g -> g (Maybe (Edge g))
instance AdjacencyMatrixGraph g => AdjacencyMatrixGraph (Strict.StateT s g) where
edge :: Vertex (StateT s g)
-> Vertex (StateT s g) -> StateT s g (Maybe (Edge (StateT s g)))
edge Vertex (StateT s g)
a Vertex (StateT s g)
b = g (Maybe (Edge g)) -> StateT s g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (StateT s g)
a Vertex g
Vertex (StateT s g)
b)
instance AdjacencyMatrixGraph g => AdjacencyMatrixGraph (Lazy.StateT s g) where
edge :: Vertex (StateT s g)
-> Vertex (StateT s g) -> StateT s g (Maybe (Edge (StateT s g)))
edge Vertex (StateT s g)
a Vertex (StateT s g)
b = g (Maybe (Edge g)) -> StateT s g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (StateT s g)
a Vertex g
Vertex (StateT s g)
b)
instance (AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (Strict.WriterT m g) where
edge :: Vertex (WriterT m g)
-> Vertex (WriterT m g) -> WriterT m g (Maybe (Edge (WriterT m g)))
edge Vertex (WriterT m g)
a Vertex (WriterT m g)
b = g (Maybe (Edge g)) -> WriterT m g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (WriterT m g)
a Vertex g
Vertex (WriterT m g)
b)
instance (AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (Lazy.WriterT m g) where
edge :: Vertex (WriterT m g)
-> Vertex (WriterT m g) -> WriterT m g (Maybe (Edge (WriterT m g)))
edge Vertex (WriterT m g)
a Vertex (WriterT m g)
b = g (Maybe (Edge g)) -> WriterT m g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (WriterT m g)
a Vertex g
Vertex (WriterT m g)
b)
instance (AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (Strict.RWST r m s g) where
edge :: Vertex (RWST r m s g)
-> Vertex (RWST r m s g)
-> RWST r m s g (Maybe (Edge (RWST r m s g)))
edge Vertex (RWST r m s g)
a Vertex (RWST r m s g)
b = g (Maybe (Edge g)) -> RWST r m s g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (RWST r m s g)
a Vertex g
Vertex (RWST r m s g)
b)
instance (AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (Lazy.RWST r m s g) where
edge :: Vertex (RWST r m s g)
-> Vertex (RWST r m s g)
-> RWST r m s g (Maybe (Edge (RWST r m s g)))
edge Vertex (RWST r m s g)
a Vertex (RWST r m s g)
b = g (Maybe (Edge g)) -> RWST r m s g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (RWST r m s g)
a Vertex g
Vertex (RWST r m s g)
b)
instance AdjacencyMatrixGraph g => AdjacencyMatrixGraph (MaybeT g) where
edge :: Vertex (MaybeT g)
-> Vertex (MaybeT g) -> MaybeT g (Maybe (Edge (MaybeT g)))
edge Vertex (MaybeT g)
a Vertex (MaybeT g)
b = g (Maybe (Edge g)) -> MaybeT g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (MaybeT g)
a Vertex g
Vertex (MaybeT g)
b)
#if !(MIN_VERSION_transformers(0,6,0))
instance (AdjacencyMatrixGraph g, Error e) => AdjacencyMatrixGraph (ErrorT e g) where
edge :: Vertex (ErrorT e g)
-> Vertex (ErrorT e g) -> ErrorT e g (Maybe (Edge (ErrorT e g)))
edge Vertex (ErrorT e g)
a Vertex (ErrorT e g)
b = g (Maybe (Edge g)) -> ErrorT e g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (ErrorT e g)
a Vertex g
Vertex (ErrorT e g)
b)
#endif
instance AdjacencyMatrixGraph g => AdjacencyMatrixGraph (IdentityT g) where
edge :: Vertex (IdentityT g)
-> Vertex (IdentityT g) -> IdentityT g (Maybe (Edge (IdentityT g)))
edge Vertex (IdentityT g)
a Vertex (IdentityT g)
b = g (Maybe (Edge g)) -> IdentityT g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (IdentityT g)
a Vertex g
Vertex (IdentityT g)
b)
instance AdjacencyMatrixGraph g => AdjacencyMatrixGraph (ReaderT e g) where
edge :: Vertex (ReaderT e g)
-> Vertex (ReaderT e g) -> ReaderT e g (Maybe (Edge (ReaderT e g)))
edge Vertex (ReaderT e g)
a Vertex (ReaderT e g)
b = g (Maybe (Edge g)) -> ReaderT e g (Maybe (Edge g))
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (Vertex g -> Vertex g -> g (Maybe (Edge g))
forall (g :: * -> *).
AdjacencyMatrixGraph g =>
Vertex g -> Vertex g -> g (Maybe (Edge g))
edge Vertex g
Vertex (ReaderT e g)
a Vertex g
Vertex (ReaderT e g)
b)
instance AdjacencyMatrixGraph Identity where
edge :: Vertex Identity
-> Vertex Identity -> Identity (Maybe (Edge Identity))
edge Vertex Identity
_ Vertex Identity
_ = Maybe Void -> Identity (Maybe Void)
forall a. a -> Identity a
Identity Maybe Void
forall a. Maybe a
Nothing