Satyros.BellmanFord.IDLGraph

Documentation

data PositiveInfiniteInt

Constructors

Finite Int

PositiveInfinity

Instances

Eq PositiveInfiniteInt

Defined in Satyros.BellmanFord.IDLGraph

Methods

(==) :: PositiveInfiniteInt -> PositiveInfiniteInt -> Bool

(/=) :: PositiveInfiniteInt -> PositiveInfiniteInt -> Bool

Ord PositiveInfiniteInt

Defined in Satyros.BellmanFord.IDLGraph

Methods

compare :: PositiveInfiniteInt -> PositiveInfiniteInt -> Ordering

(<) :: PositiveInfiniteInt -> PositiveInfiniteInt -> Bool

(<=) :: PositiveInfiniteInt -> PositiveInfiniteInt -> Bool

(>) :: PositiveInfiniteInt -> PositiveInfiniteInt -> Bool

(>=) :: PositiveInfiniteInt -> PositiveInfiniteInt -> Bool

max :: PositiveInfiniteInt -> PositiveInfiniteInt -> PositiveInfiniteInt

min :: PositiveInfiniteInt -> PositiveInfiniteInt -> PositiveInfiniteInt

Show PositiveInfiniteInt

Defined in Satyros.BellmanFord.IDLGraph

Methods

showsPrec :: Int -> PositiveInfiniteInt -> ShowS

show :: PositiveInfiniteInt -> String

showList :: [PositiveInfiniteInt] -> ShowS

MonadState BellmanFordStore BellmanFord

Defined in Satyros.BellmanFord.Effect

Methods

get :: BellmanFord BellmanFordStore

put :: BellmanFordStore -> BellmanFord ()

state :: (BellmanFordStore -> (a, BellmanFordStore)) -> BellmanFord a

addPositiveInfiniteInt :: PositiveInfiniteInt -> PositiveInfiniteInt -> PositiveInfiniteInt

toInt :: PositiveInfiniteInt -> Maybe Int

type IDLGraph = Map (IDLGraphVertex, IDLGraphVertex) Int

type IDLGraphVertex = Maybe Variable

type IDLWeightMap = Map IDLGraphVertex (IDLGraphVertex, PositiveInfiniteInt)

rootIDLGraphVertex :: IDLGraphVertex

initializeIDL :: [Expressed] -> (IDLGraph, IDLWeightMap)