graphs-0.7.3: A simple monadic graph library
Copyright(C) 2011 Edward Kmett
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <[email protected]>
Stabilityexperimental
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Graph.PropertyMap

Description

Total transient monadic maps, used to track information about vertices and edges in a graph

Documentation

data PropertyMap (m :: Type -> Type) k v Source #

Constructors

PropertyMap 

Fields

modifyP :: Monad m => PropertyMap m k v -> k -> (v -> v) -> m (PropertyMap m k v) Source #

intPropertyMap :: forall (m :: Type -> Type) v. Monad m => v -> PropertyMap m Int v Source #

propertyMap :: forall (m :: Type -> Type) k v. (Monad m, Ord k) => v -> PropertyMap m k v Source #

liftPropertyMap :: forall (t :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) k v. (MonadTrans t, Monad m, Monad (t m)) => PropertyMap m k v -> PropertyMap (t m) k v Source #