Purely functional Dijkstra algorithm using priority search queue to find shortest pathsgistfile1.hs � � �� ��� �� -- % cabal install PSQueue -- % ghci Dijkstra.hs -- > dijkstra sample A -- [(A,0,A),(D,4,A),(E,7,D),(C,8,E),(B,9,E)] module Dijkstra where import Control.Applicative hiding (empty) import Data.List (unfoldr) import Data.Maybe (fromJust) import Data.PSQueue (PSQ, Binding(..)) import qualified Data.PSQueue as PSQ ------------------------------------------------------------
Data.mapについて
