{"blog_title":"(void*)P\u306a\u3044\u3068","blog_url":"https://pknight.hatenablog.com/","version":"1.0","author_name":"pknight","height":"190","type":"rich","image_url":null,"author_url":"https://blog.hatena.ne.jp/pknight/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fpknight.hatenablog.com%2Fentry%2F20100125%2F1264428236\" title=\"A-star\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0 - (void*)P\u306a\u3044\u3068\" 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","categories":["C","algorithm"],"url":"https://pknight.hatenablog.com/entry/20100125/1264428236","provider_url":"https://hatena.blog","published":"2010-01-25 23:03:56","width":"100%","description":"\u4eba\u6750\u7372\u5f97\u4f5c\u6226\u30fb\uff14 \u8a66\u9a13\u554f\u984c\u307b\u304b: \u4eba\u751f\u3092\u66f8\u304d\u63db\u3048\u308b\u8005\u3059\u3089\u3044\u305f\u3002\u3053\u306e\u554f\u984c\u3092C\u8a00\u8a9e\u306e\u52c9\u5f37\u304c\u3066\u3089\u3084\u3063\u3066\u307f\u307e\u3057\u305f\u3002\u5e45\u512a\u5148\u63a2\u7d22\u3068\u304b\u8272\u3005\u65b9\u6cd5\u306f\u3042\u308b\u307f\u305f\u3044\u3067\u3059\u304c\u3001A-star\u306a\u3093\u3066\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u304c\u3042\u308b\u3089\u3057\u304f\u3001\u6298\u89d2\u306a\u306e\u3067\u8abf\u3079\u306a\u304c\u3089\u3084\u3063\u3066\u307f\u307e\u3057\u305f\u3002A* - Wikipedia #include <stdio.h> #define ARRAY_NUM(a) (sizeof(a)/sizeof(a[0])) #define NODE_MAX 1000 struct NODE { int i; int j; int cost; struct NODE *parent; }; typedef struct NODE NO\u2026","title":"A-star\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0"}