yuyarin https://blog.hatena.ne.jp/yuyarin/ yuyarinの日記 https://yuyarin.hatenadiary.org/ Ruby Algorithm Rubyでダイクストラ法を使って始点からの最短経路を求めることができるかもしれないコード 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… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyuyarin.hatenadiary.org%2Fentry%2F20110820%2F1313766566" title="Rubyでdijkstra法 - yuyarinの日記" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2011-08-20 00:09:26 rich https://yuyarin.hatenadiary.org/entry/20110820/1313766566 1.0 100%