Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- class MGraph d where
- newtype MLGraph m d v e = MLGraph IGraph
- setEdgeAttr :: (PrimMonad m, Serialize e) => Int -> e -> MLGraph (PrimState m) d v e -> m ()
- setNodeAttr :: (PrimMonad m, Serialize v) => Int -> v -> MLGraph (PrimState m) d v e -> m ()
- edgeAttr :: String
- vertexAttr :: String
- withVertexAttr :: (CString -> IO a) -> IO a
- withEdgeAttr :: (CString -> IO a) -> IO a
Documentation
new :: PrimMonad m => Int -> m (MLGraph (PrimState m) d v e) Source #
Create a new graph.
Add nodes to the graph.
Add nodes with labels to the graph.
delNodes :: PrimMonad m => [Int] -> MLGraph (PrimState m) d v e -> m () Source #
Delete nodes from the graph.
addEdges :: PrimMonad m => [(Int, Int)] -> MLGraph (PrimState m) d v e -> m () Source #
Add edges to the graph.
addLEdges :: (PrimMonad m, Serialize e) => [LEdge e] -> MLGraph (PrimState m) d v e -> m () Source #
Add edges with labels to the graph.
delEdges :: PrimMonad m => [(Int, Int)] -> MLGraph (PrimState m) d v e -> m () Source #
Delete edges from the graph.
Instances
Set edge attribute.
Set node attribute.
vertexAttr :: String Source #