| Safe Haskell | Safe |
|---|---|
| Language | Haskell98 |
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) Source
Edge relaxation.
bellmanFord :: Ord a => Map (a, a) Double -> a -> Map a (a, Double) Source
The Bellman-Ford shortest path algorithm.
retrievePath :: Ord a => Map a (a, Double) -> a -> a -> [a] Source