{"title":"Dijkstra\uff081\u5bfe\u5168\u30fb\u6700\u77ed\u8def\uff09","published":"2008-11-14 01:15:39","height":"190","image_url":null,"blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","categories":["Haskell","algorithm"],"url":"https://jeneshicc.hatenadiary.org/entry/20081114/1226679339","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081114%2F1226679339\" title=\"Dijkstra\uff081\u5bfe\u5168\u30fb\u6700\u77ed\u8def\uff09 - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/jeneshicc/","author_name":"jeneshicc","version":"1.0","provider_name":"Hatena Blog","type":"rich","description":"Dijkstra \u307e\u3060\u4e00\u5ea6\u3082\u8d70\u3089\u305b\u3066\u3044\u306a\u3044\u3002 \u305f\u3076\u3093\u30d0\u30b0\u3042\u308a\u3002 module Dijkstra where import Data.List import Data.Graph import Data.Array.IArray import Debug.Trace import qualified Data.Set as Set type Weight = Array Edge Int -- g=graph, w=weight, d=distance, p=path, q=queue dijkstra :: Graph -> Weight -> Set.Set (Int,Vertex) -> \u2026","provider_url":"https://hatena.blog","blog_url":"https://jeneshicc.hatenadiary.org/"}