Satyros.BellmanFord.Storage

Documentation

type Storage = IDLWeightMap

type IDLGraph = Map (IDLGraphVertex, IDLGraphVertex) Int

type IDLGraphVertex = Maybe Variable

type IDLWeightMap = Map IDLGraphVertex (IDLGraphVertex, PositiveInfiniteInt)

rootIDLGraphVertex :: IDLGraphVertex

initializeStorage :: [Expressed] -> (IDLGraph, Storage)

storageToValues :: IDLWeightMap -> [Int]

data PositiveInfiniteInt

Constructors

Finite Int

PositiveInfinity

Instances

Eq PositiveInfiniteInt

Defined in Satyros.BellmanFord.Storage

Methods

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

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

Ord PositiveInfiniteInt

Defined in Satyros.BellmanFord.Storage

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.Storage

Methods

showsPrec :: Int -> PositiveInfiniteInt -> ShowS

show :: PositiveInfiniteInt -> String

showList :: [PositiveInfiniteInt] -> ShowS

Generic PositiveInfiniteInt

Defined in Satyros.BellmanFord.Storage

Associated Types

type Rep PositiveInfiniteInt :: Type -> Type

Methods

from :: PositiveInfiniteInt -> Rep PositiveInfiniteInt x

to :: Rep PositiveInfiniteInt x -> PositiveInfiniteInt

MonadState Storage BellmanFord

Defined in Satyros.BellmanFord.Effect

Methods

get :: BellmanFord Storage

put :: Storage -> BellmanFord ()

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

type Rep PositiveInfiniteInt

Defined in Satyros.BellmanFord.Storage

type Rep PositiveInfiniteInt = D1 ('MetaData "PositiveInfiniteInt" "Satyros.BellmanFord.Storage" "satyros-0.2.2.1-GdlwvJvvIuCOK4gG1gnoo" 'False) (C1 ('MetaCons "Finite" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :+: C1 ('MetaCons "PositiveInfinity" 'PrefixI 'False) (U1 :: Type -> Type))

addPositiveInfiniteInt :: PositiveInfiniteInt -> PositiveInfiniteInt -> PositiveInfiniteInt