RosettaCodeData/Task/Floyd-Warshall-algorithm/Haskell/floyd-warshall-algorithm-2.hs

mirror of https://github.com/acmeism/RosettaCodeData.git
data Shortest b a = Shortest { distance :: a, path :: [b] }
                  deriving Show
	`data Shortest b a = Shortest { distance :: a, path :: [b] }`
	`deriving Show`