Documentation

type Weight w = (Ord w, Num w, Show w) #

type CachedMaxChildWeight w = HashMap Node (Maybe w) #

heaviestPathOutOf :: forall a b gr m w. (Show a, Graph gr, Monad m, Weight w) => (a -> w) -> gr a b -> Node -> ExceptT Text (StateT (CachedMaxChildWeight w) m) w #

findHeaviestPathInDagForest :: forall a b gr w. (Show a, Show b, Weight w, DynGraph gr) => (a -> w) -> gr a b -> Either Text w #

dagRoots :: DynGraph gr => gr a b -> [Node] #