IGraph.Types

Documentation

type Node = Int

type LNode a = (Node, a)

type Edge = (Node, Node)

type LEdge a = (Edge, a)

data U

Undirected graph.

Instances

MGraph U

Methods

new :: PrimMonad m => Int -> m (MLGraph (PrimState m) U v e)

addNodes :: PrimMonad m => Int -> MLGraph (PrimState m) U v e -> m ()

addLNodes :: (Serialize v, PrimMonad m) => [v] -> MLGraph (PrimState m) U v e -> m ()

delNodes :: PrimMonad m => [Int] -> MLGraph (PrimState m) U v e -> m ()

addEdges :: PrimMonad m => [(Int, Int)] -> MLGraph (PrimState m) U v e -> m ()

addLEdges :: (PrimMonad m, Serialize e) => [LEdge e] -> MLGraph (PrimState m) U v e -> m ()

delEdges :: PrimMonad m => [(Int, Int)] -> MLGraph (PrimState m) U v e -> m ()

Graph U

Methods

isDirected :: LGraph U v e -> Bool

isD :: U -> Bool

nNodes :: LGraph U v e -> Int

nodes :: LGraph U v e -> [Node]

labNodes :: Serialize v => LGraph U v e -> [LNode v]

nEdges :: LGraph U v e -> Int

edges :: LGraph U v e -> [Edge]

labEdges :: Serialize e => LGraph U v e -> [LEdge e]

hasEdge :: LGraph U v e -> Edge -> Bool

nodeLab :: Serialize v => LGraph U v e -> Node -> v

getNodes :: (Hashable v, Eq v) => LGraph U v e -> v -> [Node]

edgeLab :: Serialize e => LGraph U v e -> Edge -> e

getEdgeByEid :: LGraph U v e -> Int -> Edge

getEdgeLabByEid :: Serialize e => LGraph U v e -> Int -> e

data D

Directed graph.

Instances

MGraph D

Methods

new :: PrimMonad m => Int -> m (MLGraph (PrimState m) D v e)

addNodes :: PrimMonad m => Int -> MLGraph (PrimState m) D v e -> m ()

addLNodes :: (Serialize v, PrimMonad m) => [v] -> MLGraph (PrimState m) D v e -> m ()

delNodes :: PrimMonad m => [Int] -> MLGraph (PrimState m) D v e -> m ()

addEdges :: PrimMonad m => [(Int, Int)] -> MLGraph (PrimState m) D v e -> m ()

addLEdges :: (PrimMonad m, Serialize e) => [LEdge e] -> MLGraph (PrimState m) D v e -> m ()

delEdges :: PrimMonad m => [(Int, Int)] -> MLGraph (PrimState m) D v e -> m ()

Graph D

Methods

isDirected :: LGraph D v e -> Bool

isD :: D -> Bool

nNodes :: LGraph D v e -> Int

nodes :: LGraph D v e -> [Node]

labNodes :: Serialize v => LGraph D v e -> [LNode v]

nEdges :: LGraph D v e -> Int

edges :: LGraph D v e -> [Edge]

labEdges :: Serialize e => LGraph D v e -> [LEdge e]

hasEdge :: LGraph D v e -> Edge -> Bool

nodeLab :: Serialize v => LGraph D v e -> Node -> v

getNodes :: (Hashable v, Eq v) => LGraph D v e -> v -> [Node]

edgeLab :: Serialize e => LGraph D v e -> Edge -> e

getEdgeByEid :: LGraph D v e -> Int -> Edge

getEdgeLabByEid :: Serialize e => LGraph D v e -> Int -> e

vertexAttr :: String

edgeAttr :: String