{"version":"1.0","provider_name":"Hatena Blog","url":"https://mzp.hatenadiary.org/entry/20091219/graph","author_name":"mzp","type":"rich","height":"190","width":"100%","provider_url":"https://hatena.blog","blog_url":"https://mzp.hatenadiary.org/","categories":["Haskell","30\u5206\u30d7\u30ed\u30b0\u30e9\u30e0"],"description":"30\u5206\u30d7\u30ed\u30b0\u30e9\u30e0\u3001\u305d\u306e710\u3002Haskell\u3067\u30b0\u30e9\u30d5\u3092\u6271\u3044\u305f\u304b\u3063\u305f\u306e\u3067\u3001Data.Graph\u3092\u8a66\u3057\u3066\u307f\u307e\u3057\u305f\u3002mkGraph\u306e\u8fd4\u3059\u30b0\u30e9\u30d5\u306e\u578b\u304c\u3001\u5177\u4f53\u7684\u306a\u578b\u3067\u306f\u306a\u304f\u3001gr\u306b\u306a\u3063\u3066\u3044\u307e\u3059\u3002 *Main> :t mkGraph mkGraph :: (Graph gr) => [LNode a] -> [LEdge b] -> gr a b \u3053\u308c\u306f\u3053\u308c\u3067\u4fbf\u5229\u306a\u3093\u3067\u3057\u3087\u3046\u304c\u3001\u4eca\u56de\u306f\u9762\u5012\u306a\u306e\u3067Gr\u306b\u675f\u7e1b\u3057\u3066\u3044\u307e\u3059\u3002 *main> :i Gr data Gr a b = .... ... instance [overlap ok] Graph Gr -- Defined in Data.Graph.Ind\u2026","blog_title":"\u307f\u305a\u3074\u30fc\u65e5\u8a18","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmzp.hatenadiary.org%2Fentry%2F20091219%2Fgraph\" title=\"Data.Graph\u3092\u8a66\u305d\u3046 - \u307f\u305a\u3074\u30fc\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","title":"Data.Graph\u3092\u8a66\u305d\u3046","author_url":"https://blog.hatena.ne.jp/mzp/","image_url":null,"published":"2009-12-19 00:00:00"}