Data.Graph.AdjacencyList

Documentation

newtype AdjacencyList i a

Constructors

AdjacencyList

Fields

• runAdjacencyList :: Array i [i] -> a

Instances

Monad (AdjacencyList i)

Methods

(>>=) :: AdjacencyList i a -> (a -> AdjacencyList i b) -> AdjacencyList i b

(>>) :: AdjacencyList i a -> AdjacencyList i b -> AdjacencyList i b

return :: a -> AdjacencyList i a

fail :: String -> AdjacencyList i a

Functor (AdjacencyList i)

Methods

fmap :: (a -> b) -> AdjacencyList i a -> AdjacencyList i b

(<$) :: a -> AdjacencyList i b -> AdjacencyList i a

Applicative (AdjacencyList i)

Methods

pure :: a -> AdjacencyList i a

(<*>) :: AdjacencyList i (a -> b) -> AdjacencyList i a -> AdjacencyList i b

liftA2 :: (a -> b -> c) -> AdjacencyList i a -> AdjacencyList i b -> AdjacencyList i c

(*>) :: AdjacencyList i a -> AdjacencyList i b -> AdjacencyList i b

(<*) :: AdjacencyList i a -> AdjacencyList i b -> AdjacencyList i a

Ord i => Graph (AdjacencyList i)

Associated Types

type Vertex (AdjacencyList i :: * -> *) :: *

type Edge (AdjacencyList i :: * -> *) :: *

Methods

vertexMap :: a -> AdjacencyList i (VertexMap (AdjacencyList i) a)

edgeMap :: a -> AdjacencyList i (EdgeMap (AdjacencyList i) a)

Ix i => AdjacencyListGraph (AdjacencyList i)

Methods

source :: Edge (AdjacencyList i) -> AdjacencyList i (Vertex (AdjacencyList i))

target :: Edge (AdjacencyList i) -> AdjacencyList i (Vertex (AdjacencyList i))

outEdges :: Vertex (AdjacencyList i) -> AdjacencyList i [Edge (AdjacencyList i)]

outDegree :: Vertex (AdjacencyList i) -> AdjacencyList i Int

adjacentVertices :: Vertex (AdjacencyList i) -> AdjacencyList i [Vertex (AdjacencyList i)]

type Vertex (AdjacencyList i)

type Vertex (AdjacencyList i) = i

type Edge (AdjacencyList i)

type Edge (AdjacencyList i) = (i, i)

class Graph g => AdjacencyListGraph g

Minimal definition: source, target, and either adjacentVertices with outEdges = defaultOutEdges or outEdges

Minimal complete definition

source, target, outEdges

Instances

AdjacencyListGraph Identity

Methods

source :: Edge Identity -> Identity (Vertex Identity)

target :: Edge Identity -> Identity (Vertex Identity)

outEdges :: Vertex Identity -> Identity [Edge Identity]

outDegree :: Vertex Identity -> Identity Int

adjacentVertices :: Vertex Identity -> Identity [Vertex Identity]

AdjacencyListGraph g => AdjacencyListGraph (MaybeT g)

Methods

source :: Edge (MaybeT g) -> MaybeT g (Vertex (MaybeT g))

target :: Edge (MaybeT g) -> MaybeT g (Vertex (MaybeT g))

outEdges :: Vertex (MaybeT g) -> MaybeT g [Edge (MaybeT g)]

outDegree :: Vertex (MaybeT g) -> MaybeT g Int

adjacentVertices :: Vertex (MaybeT g) -> MaybeT g [Vertex (MaybeT g)]

BidirectionalGraph g => AdjacencyListGraph (Dual g)

Methods

source :: Edge (Dual g) -> Dual g (Vertex (Dual g))

target :: Edge (Dual g) -> Dual g (Vertex (Dual g))

outEdges :: Vertex (Dual g) -> Dual g [Edge (Dual g)]

outDegree :: Vertex (Dual g) -> Dual g Int

adjacentVertices :: Vertex (Dual g) -> Dual g [Vertex (Dual g)]

Ix i => AdjacencyListGraph (AdjacencyList i)

Methods

source :: Edge (AdjacencyList i) -> AdjacencyList i (Vertex (AdjacencyList i))

target :: Edge (AdjacencyList i) -> AdjacencyList i (Vertex (AdjacencyList i))

outEdges :: Vertex (AdjacencyList i) -> AdjacencyList i [Edge (AdjacencyList i)]

outDegree :: Vertex (AdjacencyList i) -> AdjacencyList i Int

adjacentVertices :: Vertex (AdjacencyList i) -> AdjacencyList i [Vertex (AdjacencyList i)]

(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (WriterT m g)

Methods

source :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g))

target :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g))

outEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)]

outDegree :: Vertex (WriterT m g) -> WriterT m g Int

adjacentVertices :: Vertex (WriterT m g) -> WriterT m g [Vertex (WriterT m g)]

(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (WriterT m g)

Methods

source :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g))

target :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g))

outEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)]

outDegree :: Vertex (WriterT m g) -> WriterT m g Int

adjacentVertices :: Vertex (WriterT m g) -> WriterT m g [Vertex (WriterT m g)]

AdjacencyListGraph g => AdjacencyListGraph (StateT s g)

Methods

source :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g))

target :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g))

outEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)]

outDegree :: Vertex (StateT s g) -> StateT s g Int

adjacentVertices :: Vertex (StateT s g) -> StateT s g [Vertex (StateT s g)]

AdjacencyListGraph g => AdjacencyListGraph (StateT s g)

Methods

source :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g))

target :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g))

outEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)]

outDegree :: Vertex (StateT s g) -> StateT s g Int

adjacentVertices :: Vertex (StateT s g) -> StateT s g [Vertex (StateT s g)]

AdjacencyListGraph g => AdjacencyListGraph (IdentityT * g)

Methods

source :: Edge (IdentityT * g) -> IdentityT * g (Vertex (IdentityT * g))

target :: Edge (IdentityT * g) -> IdentityT * g (Vertex (IdentityT * g))

outEdges :: Vertex (IdentityT * g) -> IdentityT * g [Edge (IdentityT * g)]

outDegree :: Vertex (IdentityT * g) -> IdentityT * g Int

adjacentVertices :: Vertex (IdentityT * g) -> IdentityT * g [Vertex (IdentityT * g)]

(AdjacencyListGraph g, Error e) => AdjacencyListGraph (ErrorT e g)

Methods

source :: Edge (ErrorT e g) -> ErrorT e g (Vertex (ErrorT e g))

target :: Edge (ErrorT e g) -> ErrorT e g (Vertex (ErrorT e g))

outEdges :: Vertex (ErrorT e g) -> ErrorT e g [Edge (ErrorT e g)]

outDegree :: Vertex (ErrorT e g) -> ErrorT e g Int

adjacentVertices :: Vertex (ErrorT e g) -> ErrorT e g [Vertex (ErrorT e g)]

AdjacencyListGraph g => AdjacencyListGraph (ReaderT * e g)

Methods

source :: Edge (ReaderT * e g) -> ReaderT * e g (Vertex (ReaderT * e g))

target :: Edge (ReaderT * e g) -> ReaderT * e g (Vertex (ReaderT * e g))

outEdges :: Vertex (ReaderT * e g) -> ReaderT * e g [Edge (ReaderT * e g)]

outDegree :: Vertex (ReaderT * e g) -> ReaderT * e g Int

adjacentVertices :: Vertex (ReaderT * e g) -> ReaderT * e g [Vertex (ReaderT * e g)]

(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (RWST r m s g)

Methods

source :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g))

target :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g))

outEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)]

outDegree :: Vertex (RWST r m s g) -> RWST r m s g Int

adjacentVertices :: Vertex (RWST r m s g) -> RWST r m s g [Vertex (RWST r m s g)]

(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (RWST r m s g)

Methods

source :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g))

target :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g))

outEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)]

outDegree :: Vertex (RWST r m s g) -> RWST r m s g Int

adjacentVertices :: Vertex (RWST r m s g) -> RWST r m s g [Vertex (RWST r m s g)]

ask :: AdjacencyList i (Array i [i])