Safe Haskell	None
Language	Haskell2010

Pangraph

Contents

Abstract Types
Constructors
Pangraph Getters
Getters on Vertex and Edge

Description

See Pangraph for the type which provides a guaranteed well-formed graph once constructed. The rest of the modules provides constructors and getters on this type.

Synopsis

data Pangraph
data Edge
data Vertex
type Attribute = (Key, Value)
type Key = ByteString
type Value = ByteString
type VertexID = ByteString
type EdgeID = Int
type MalformedEdge = (Edge, (Maybe VertexID, Maybe VertexID))
makePangraph :: [Vertex] -> [Edge] -> Maybe Pangraph
makeEdge :: (VertexID, VertexID) -> [Attribute] -> Edge
makeVertex :: VertexID -> [Attribute] -> Vertex
edgeList :: Pangraph -> [Edge]
vertexList :: Pangraph -> [Vertex]
lookupVertex :: VertexID -> Pangraph -> Maybe Vertex
lookupEdge :: EdgeID -> Pangraph -> Maybe Edge
edgeAttributes :: Edge -> [Attribute]
vertexAttributes :: Vertex -> [Attribute]
edgeEndpoints :: Edge -> (VertexID, VertexID)
edgeID :: Edge -> Maybe EdgeID
vertexID :: Vertex -> VertexID

Abstract Types

data Pangraph Source #

The Pangraph type is the core intermediate type between abstract representations of graphs.

Instances

Eq Pangraph Source #
Instance details Defined in Pangraph Methods (==) :: Pangraph -> Pangraph -> Bool # (/=) :: Pangraph -> Pangraph -> Bool #
Show Pangraph Source #
Instance details Defined in Pangraph Methods showsPrec :: Int -> Pangraph -> ShowS # show :: Pangraph -> String # showList :: [Pangraph] -> ShowS #
ToGraph Pangraph Source #
Instance details Defined in Pangraph Associated Types type ToVertex Pangraph :: * # Methods toGraph :: Pangraph -> Graph (ToVertex Pangraph) # foldg :: r -> (ToVertex Pangraph -> r) -> (r -> r -> r) -> (r -> r -> r) -> Pangraph -> r # isEmpty :: Pangraph -> Bool # size :: Pangraph -> Int # hasVertex :: ToVertex Pangraph -> Pangraph -> Bool # hasEdge :: ToVertex Pangraph -> ToVertex Pangraph -> Pangraph -> Bool # vertexCount :: Pangraph -> Int # edgeCount :: Pangraph -> Int # vertexList :: Pangraph -> [ToVertex Pangraph] # edgeList :: Pangraph -> [(ToVertex Pangraph, ToVertex Pangraph)] # vertexSet :: Pangraph -> Set (ToVertex Pangraph) # vertexIntSet :: Pangraph -> IntSet # edgeSet :: Pangraph -> Set (ToVertex Pangraph, ToVertex Pangraph) # preSet :: ToVertex Pangraph -> Pangraph -> Set (ToVertex Pangraph) # preIntSet :: Int -> Pangraph -> IntSet # postSet :: ToVertex Pangraph -> Pangraph -> Set (ToVertex Pangraph) # postIntSet :: Int -> Pangraph -> IntSet # adjacencyList :: Pangraph -> [(ToVertex Pangraph, [ToVertex Pangraph])] # adjacencyMap :: Pangraph -> Map (ToVertex Pangraph) (Set (ToVertex Pangraph)) # adjacencyIntMap :: Pangraph -> IntMap IntSet # adjacencyMapTranspose :: Pangraph -> Map (ToVertex Pangraph) (Set (ToVertex Pangraph)) # adjacencyIntMapTranspose :: Pangraph -> IntMap IntSet # dfsForest :: Pangraph -> Forest (ToVertex Pangraph) # dfsForestFrom :: [ToVertex Pangraph] -> Pangraph -> Forest (ToVertex Pangraph) # dfs :: [ToVertex Pangraph] -> Pangraph -> [ToVertex Pangraph] # reachable :: ToVertex Pangraph -> Pangraph -> [ToVertex Pangraph] # topSort :: Pangraph -> Maybe [ToVertex Pangraph] # isAcyclic :: Pangraph -> Bool # toAdjacencyMap :: Pangraph -> AdjacencyMap (ToVertex Pangraph) # toAdjacencyMapTranspose :: Pangraph -> AdjacencyMap (ToVertex Pangraph) # toAdjacencyIntMap :: Pangraph -> AdjacencyIntMap # toAdjacencyIntMapTranspose :: Pangraph -> AdjacencyIntMap # isDfsForestOf :: Forest (ToVertex Pangraph) -> Pangraph -> Bool # isTopSortOf :: [ToVertex Pangraph] -> Pangraph -> Bool #
type ToVertex Pangraph Source #
Instance details Defined in Pangraph type ToVertex Pangraph = VertexID

data Edge Source #

Edges also reqiure [Attribute] and a tuple of Vertex passed as connections to be constructed with makeEdge

Instances

Eq Edge Source #
Instance details Defined in Pangraph Methods (==) :: Edge -> Edge -> Bool # (/=) :: Edge -> Edge -> Bool #
Show Edge Source #
Instance details Defined in Pangraph Methods showsPrec :: Int -> Edge -> ShowS # show :: Edge -> String # showList :: [Edge] -> ShowS #

data Vertex Source #

A Vertex holds [Attribute] and must have a unique VertexID to be constructed with makeVertex.

Instances

Eq Vertex Source #
Instance details Defined in Pangraph Methods (==) :: Vertex -> Vertex -> Bool # (/=) :: Vertex -> Vertex -> Bool #
Show Vertex Source #
Instance details Defined in Pangraph Methods showsPrec :: Int -> Vertex -> ShowS # show :: Vertex -> String # showList :: [Vertex] -> ShowS #