Data.BellmanFord

Documentation

relaxEdge :: (Fractional b, Ord b, Ord t, Ord t1) => Map t (a, b) -> Map (t, t1) b -> t1 -> (t, b) -> (t, b)

Edge relaxation.

bellmanFord :: Ord a => Map (a, a) Double -> a -> Map a (a, Double)

The Bellman-Ford shortest path algorithm.

retrievePath :: Ord a => Map a (a, Double) -> a -> a -> [a]

cycles :: Ord a => Map (a, a) () -> a -> Maybe a

Cycle finding