{"width":"100%","title":"\u8ff7\u8def\u89e3\u7b54\u3082Lisp\u3067","blog_title":"Let's write \u03b2","type":"rich","url":"https://tech-blog.pocket7878.com/entry/2013/01/29/192046","image_url":"http://cdn-ak.f.st-hatena.com/images/fotolife/P/Pocket7878_dev/20130129/20130129192004.png","categories":["Lisp"],"provider_name":"Hatena Blog","description":"cl-maze\u3068\u3044\u3046\u540d\u524d\u3067github\u306b\u7f6e\u304f\u3053\u3068\u306b\u3057\u305f\u3001\u524d\u306e\u8ff7\u8def\u3092\u69cb\u7bc9\u3059\u308b\u30d7\u30ed\u30b8\u30a7\u30af\u30c8\u3092\u3044\u304f\u3064\u304b\u30a2\u30c3\u30d7\u30c7\u30fc\u30c8\u3057\u307e\u3057\u305f\u3002 \u90e8\u5c4b\u3092room\u3068\u3044\u3046struct\u3067\u7ba1\u7406\u3059\u308b\u4e8b\u306b\u3057\u305f Dijkstra\u6cd5\u3092\u3082\u3061\u3044\u3066\u89e3\u7b54\u3092\u8a08\u7b97\u3059\u308b\u3088\u3046\u306b\u3057\u305f \u4ee5\u4e0b\u306f\u3001\u305d\u306e\u30e1\u30bd\u30c3\u30c9\u3068\u8868\u793a\u3055\u308c\u308b\u7d50\u679c (defmethod solve ((maze <maze>)) ;;Calcurate each cell minimum distance from start (let ((U (queues:make-queue :priority-queue :compare (lambda (r1 r2) (< (cdr r1) (cdr\u2026","published":"2013-01-29 19:20:46","height":"190","blog_url":"https://tech-blog.pocket7878.com/","author_url":"https://blog.hatena.ne.jp/Pocket7878_dev/","version":"1.0","provider_url":"https://hatena.blog","author_name":"Pocket7878_dev","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftech-blog.pocket7878.com%2Fentry%2F2013%2F01%2F29%2F192046\" title=\"\u8ff7\u8def\u89e3\u7b54\u3082Lisp\u3067 - Let&#39;s write \u03b2\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}