solve-1.3: Solving simple games

LicenseMIT
MaintainerJoe Leslie-Hurd <joe@gilith.com>
Stabilityprovisional
Portabilityportable
Safe HaskellSafe
LanguageHaskell98

Solve.Graph

Description

 

Documentation

type DfsPre n a v = n -> Either v [(a, n)] Source #

type DfsPost n a v = n -> [((a, n), Maybe v)] -> v Source #

type DfsResult n v = Map n v Source #

dfsWith :: Ord n => DfsPre n a v -> DfsPost n a v -> DfsResult n v -> n -> (v, DfsResult n v) Source #

dfs :: Ord n => DfsPre n a v -> DfsPost n a v -> n -> (v, DfsResult n v) Source #

eval :: Ord n => DfsResult n v -> n -> Maybe v Source #

evalUnsafe :: Ord n => DfsResult n v -> n -> v Source #

bfs :: Ord n => (n -> [n]) -> n -> [n] Source #