Safe Haskell	Safe-Inferred
Language	GHC2021

Data.Graph.Sparse

Synopsis

type Vertex = Int
type Edge = (Vertex, Vertex)
type EdgeWith w = (Vertex, Vertex, w)
type EdgeId = Int
data SparseGraph w = SparseGraph {
- numVerticesSG :: !Int
- numEdgesSG :: !Int
- offsetSG :: !(Vector Int)
- adjacentSG :: !(Vector Vertex)
- edgeCtxSG :: !(Vector w)
}
data SparseGraphBuilder s w = SparseGraphBuilder {
- numVerticesSGB :: !Int
- bufferSGB :: Buffer s (EdgeWith w)
- outDegSGB :: MVector s Int
}
buildSparseGraph :: Unbox w => Int -> Int -> (forall s. SparseGraphBuilder s w -> ST s ()) -> SparseGraph w
addDirectedEdge :: (Unbox w, PrimMonad m) => SparseGraphBuilder (PrimState m) w -> EdgeWith w -> m ()
addUndirectedEdge :: (Unbox w, PrimMonad m) => SparseGraphBuilder (PrimState m) w -> EdgeWith w -> m ()
addDirectedEdge_ :: PrimMonad m => SparseGraphBuilder (PrimState m) () -> Edge -> m ()
addUndirectedEdge_ :: PrimMonad m => SparseGraphBuilder (PrimState m) () -> Edge -> m ()
buildDirectedGraph :: Int -> Int -> Vector Edge -> SparseGraph ()
buildUndirectedGraph :: Int -> Int -> Vector Edge -> SparseGraph ()
buildDirectedGraphW :: Unbox w => Int -> Int -> Vector (EdgeWith w) -> SparseGraph w
buildUndirectedGraphW :: Unbox w => Int -> Int -> Vector (EdgeWith w) -> SparseGraph w
adj :: SparseGraph w -> Vertex -> Vector Vertex
iadj :: SparseGraph w -> Vertex -> Vector (EdgeId, Vertex)
adjW :: Unbox w => SparseGraph w -> Vertex -> Vector (Vertex, w)
iadjW :: Unbox w => SparseGraph w -> Vertex -> Vector (EdgeId, Vertex, w)
outEdges :: SparseGraph w -> Vertex -> Vector EdgeId
outDegree :: SparseGraph w -> Vertex -> Int
outDegrees :: SparseGraph w -> Vector Int

Documentation

type Vertex = Int Source #

type Edge = (Vertex, Vertex) Source #

type EdgeWith w = (Vertex, Vertex, w) Source #

type EdgeId = Int Source #

data SparseGraph w Source #

CSR (Compressed Sparse Row)

Constructors

SparseGraph
Fields numVerticesSG :: !Int numEdgesSG :: !Int offsetSG :: !(Vector Int) adjacentSG :: !(Vector Vertex) edgeCtxSG :: !(Vector w)

data SparseGraphBuilder s w Source #

Constructors

SparseGraphBuilder
Fields numVerticesSGB :: !Int bufferSGB :: Buffer s (EdgeWith w) outDegSGB :: MVector s Int

buildSparseGraph Source #

Arguments

:: Unbox w
=> Int	the number of vertices
-> Int	upper bound on the number of edges
-> (forall s. SparseGraphBuilder s w -> ST s ())
-> SparseGraph w

addDirectedEdge :: (Unbox w, PrimMonad m) => SparseGraphBuilder (PrimState m) w -> EdgeWith w -> m () Source #

addUndirectedEdge :: (Unbox w, PrimMonad m) => SparseGraphBuilder (PrimState m) w -> EdgeWith w -> m () Source #

addDirectedEdge_ :: PrimMonad m => SparseGraphBuilder (PrimState m) () -> Edge -> m () Source #

addUndirectedEdge_ :: PrimMonad m => SparseGraphBuilder (PrimState m) () -> Edge -> m () Source #

buildDirectedGraph Source #

Arguments

:: Int	the number of vertices
-> Int	upper bound on the number of edges
-> Vector Edge
-> SparseGraph ()

buildUndirectedGraph Source #

Arguments

:: Int	the number of vertices
-> Int	upper bound on the number of undirected edges
-> Vector Edge
-> SparseGraph ()

>>> numEdgesSG . buildUndirectedGraph 2 1 $ U.fromList [(0, 1)]
2

buildDirectedGraphW Source #

Arguments

:: Unbox w
=> Int	the number of vertices
-> Int	upper bound on the number of edges
-> Vector (EdgeWith w)
-> SparseGraph w

buildUndirectedGraphW Source #

Arguments

:: Unbox w
=> Int	the number of vertices
-> Int	upper bound on the number of undirected edges
-> Vector (EdgeWith w)
-> SparseGraph w

adj :: SparseGraph w -> Vertex -> Vector Vertex Source #

iadj :: SparseGraph w -> Vertex -> Vector (EdgeId, Vertex) Source #

adjW :: Unbox w => SparseGraph w -> Vertex -> Vector (Vertex, w) Source #

iadjW :: Unbox w => SparseGraph w -> Vertex -> Vector (EdgeId, Vertex, w) Source #

outEdges :: SparseGraph w -> Vertex -> Vector EdgeId Source #

outDegree :: SparseGraph w -> Vertex -> Int Source #

outDegrees :: SparseGraph w -> Vector Int Source #