{"width":"100%","image_url":null,"author_url":"https://blog.hatena.ne.jp/yuyarin/","version":"1.0","type":"rich","blog_url":"https://yuyarin.hatenadiary.org/","blog_title":"yuyarin\u306e\u65e5\u8a18","description":"Ruby\u3067\u30c0\u30a4\u30af\u30b9\u30c8\u30e9\u6cd5\u3092\u4f7f\u3063\u3066\u59cb\u70b9\u304b\u3089\u306e\u6700\u77ed\u7d4c\u8def\u3092\u6c42\u3081\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u304b\u3082\u3057\u308c\u306a\u3044\u30b3\u30fc\u30c9 nodes = [\"A\", \"B\", \"C\", \"D\", \"E\"] connections = [ # [node1, node2, cost(1->2), cost(2->1)] [\"A\", \"B\", 6, 9], [\"A\", \"C\", 3, 2], [\"B\", \"C\", 2, 3], [\"B\", \"D\", 4, 1], [\"C\", \"E\", 3, 8], [\"B\", \"E\", 3, 2], ] require 'pp' def dijkstra(nodes, connections, start) i\u2026","title":"Ruby\u3067dijkstra\u6cd5","categories":["Ruby","Algorithm"],"author_name":"yuyarin","height":"190","url":"https://yuyarin.hatenadiary.org/entry/20110820/1313766566","published":"2011-08-20 00:09:26","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyuyarin.hatenadiary.org%2Fentry%2F20110820%2F1313766566\" title=\"Ruby\u3067dijkstra\u6cd5 - yuyarin\u306e\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>","provider_name":"Hatena Blog"}