IGraph

Documentation

class MGraph d => Graph d where

Minimal complete definition

isDirected, isD

Methods

isDirected :: LGraph d v e -> Bool

Graph is directed or not.

isD :: d -> Bool

nNodes :: LGraph d v e -> Int

Return the number of nodes in a graph.

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

Return all nodes. nodes gr == [0 .. nNodes gr - 1].

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

nEdges :: LGraph d v e -> Int

Return the number of edges in a graph.

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

Return all edges.

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

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

Whether a edge exists in the graph.

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

Return the label of given node.

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

Return all nodes that are associated with given label.

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

Return the label of given edge.

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

Find the edge by edge ID.

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

Find the edge label by edge ID.

Instances

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

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 LGraph d v e

Graph with labeled nodes and edges.

Constructors

LGraph

Fields

• _graph :: IGraph
• _labelToNode :: HashMap v [Node]

Instances

(Graph d, Serialize v, Serialize e, Hashable v, Eq v) => Serialize (LGraph d v e)

Methods

put :: Putter (LGraph d v e)

get :: Get (LGraph d v e)

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

decodeC :: (PrimMonad m, MonadThrow m, Graph d, Serialize v, Serialize e, Hashable v, Eq v) => ConduitT ByteString o m (LGraph d v e)

Decode a graph from a stream of inputs. This may be more memory efficient than standard decode function.

empty :: (Graph d, Hashable v, Serialize v, Eq v, Serialize e) => LGraph d v e

Create a empty graph.

mkGraph

Arguments

:: (Graph d, Hashable v, Serialize v, Eq v, Serialize e)

=> [v]

Nodes. Each will be assigned a ID from 0 to N.

-> [LEdge e]

Labeled edges.

-> LGraph d v e

Create a graph.

fromLabeledEdges :: (Graph d, Hashable v, Serialize v, Eq v, Serialize e) => [((v, v), e)] -> LGraph d v e

Create a graph from labeled edges.

fromLabeledEdges'

Arguments

:: (PrimMonad m, Graph d, Hashable v, Serialize v, Eq v, Serialize e)

=> a

Input, usually a file

-> (a -> ConduitT () ((v, v), e) m ())

deserialize the input into a stream of edges

-> m (LGraph d v e)

Create a graph from a stream of labeled edges.

unsafeFreeze :: (Hashable v, Eq v, Serialize v, PrimMonad m) => MLGraph (PrimState m) d v e -> m (LGraph d v e)

Convert a mutable graph to immutable graph. The original graph may not be used afterwards.

freeze :: (Hashable v, Eq v, Serialize v, PrimMonad m) => MLGraph (PrimState m) d v e -> m (LGraph d v e)

Convert a mutable graph to immutable graph.

unsafeThaw :: PrimMonad m => LGraph d v e -> m (MLGraph (PrimState m) d v e)

Create a mutable graph. The original graph may not be used afterwards.

thaw :: (PrimMonad m, Graph d) => LGraph d v e -> m (MLGraph (PrimState m) d v e)

Create a mutable graph.

neighbors :: LGraph d v e -> Node -> [Node]

Find all neighbors of the given node.

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

Find all nodes that link to to the given node.

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

Find all nodes that have a link from the given node.

nmap :: (Graph d, Serialize v1, Serialize v2, Hashable v2, Eq v2) => (LNode v1 -> v2) -> LGraph d v1 e -> LGraph d v2 e

Apply a function to change nodes' labels.

emap :: (Graph d, Serialize e1, Serialize e2, Hashable v, Eq v, Serialize v) => (LEdge e1 -> e2) -> LGraph d v e1 -> LGraph d v e2

Apply a function to change edges' labels.

nfilter :: (Hashable v, Eq v, Serialize v, Graph d) => (LNode v -> Bool) -> LGraph d v e -> LGraph d v e

Keep nodes that satisfy the constraint.

efilter :: (Hashable v, Eq v, Serialize v, Serialize e, Graph d) => (LEdge e -> Bool) -> LGraph d v e -> LGraph d v e

Keep edges that satisfy the constraint.