Data.Graph.Immutable.Tagged

Synopsis

• newtype Vertex g = Vertex {
  • getVertex :: Int
  }
• newtype Vertices g v = Vertices {
  • getVertices :: Vector v
  }
• data Edge g = Edge {
  • edgeVertexA :: !Int
  • edgeVertexB :: !Int
  }
• data Graph g e v = Graph {
  • graphVertices :: !(Vector v)
  • graphOutboundNeighborVertices :: !(Vector (Vector Int))
  • graphOutboundNeighborEdges :: !(Vector (Vector e))
  }
• breadthFirstBy :: (Ord s, Monoid s) => (v -> v -> s -> e -> 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 ()
• 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

Documentation