Data.Graph.Immutable

Synopsis

• mapVertices :: (v -> w) -> Graph g e v -> Graph g e w
• dijkstra :: (Ord s, Monoid s) => (v -> v -> s -> e -> s) -> s -> Vertex g -> Vertex g -> Graph g e v -> s
• dijkstraTraversal :: (Ord s, Monoid s) => (v -> v -> s -> e -> s) -> s -> Vertex g -> Graph g e v -> Vertices g s
• lookupVertex :: Eq v => v -> Graph g e v -> Maybe (Vertex g)
• traverseNeighbors_ :: Applicative m => (e -> Vertex g -> v -> m a) -> Vertex g -> Graph g e v -> m ()
• lookupEdge :: Vertex g -> Vertex g -> Graph g e v -> Maybe e
• mutableIForM_ :: PrimMonad m => MVector (PrimState m) a -> (Int -> a -> m b) -> m ()
• mutableIFoldM' :: PrimMonad m => (a -> Int -> b -> m a) -> a -> MVector (PrimState m) b -> m a
• vertices :: Graph g e v -> Vertices g v
• size :: Graph g e v -> Size g
• unSize :: Size g -> Int
• vertexInt :: Vertex g -> Int
• verticesToVertexList :: Vertices g v -> [Vertex g]
• verticesTraverse_ :: Monad m => (Vertex g -> v -> m a) -> Vertices g v -> m ()
• verticesToVector :: Vertices g v -> Vector v
• verticesRead :: Vertices g v -> Vertex g -> v
• verticesLength :: Vertices g v -> Int
• verticesFreeze :: PrimMonad m => MVertices g (PrimState m) v -> m (Vertices g v)
• verticesThaw :: PrimMonad m => Vertices g v -> m (MVertices g (PrimState m) v)
• freeze :: PrimMonad m => MGraph g (PrimState m) e v -> m (Graph g e v)
• create :: PrimMonad m => (forall g. MGraph g (PrimState m) e v -> m ()) -> m (SomeGraph e v)
• with :: SomeGraph e v -> (forall g. Graph g e v -> a) -> a

Documentation