{"provider_url":"https://hatena.blog","image_url":null,"blog_title":"\u501f\u308a\u3066\u304d\u305f\u732b\u306e\u3088\u3046\u306b\u9759\u304b","author_url":"https://blog.hatena.ne.jp/quasistatic/","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fquasistatic.hatenadiary.jp%2Fentry%2F20111018%2Fp1\" title=\" Pascal\u306e\u4e09\u89d2\u5f62 #4 - \u501f\u308a\u3066\u304d\u305f\u732b\u306e\u3088\u3046\u306b\u9759\u304b\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"quasistatic","description":"create()\u3092\u5b9a\u7fa9\u3059\u308b\u524d\u306epascal2.g\u306e\u5f62\u306b\u5f15\u304d\u305a\u3089\u308c\u3066\u3046\u3063\u304b\u308a\u3057\u3066\u3044\u305f\u304c\u3001 \u30ce\u30fc\u30c9\u3092\u4f5c\u6210\u3059\u308b\u90e8\u5206\u306f\u3082\u3063\u3068\u7c21\u5358\u306b\u3067\u304d\u308b\u306e\u3060\u3063\u305f\u3002 q[0], q[i]\u306e\u4f5c\u6210\u90e8\u5206\u306ffor\u30eb\u30fc\u30d7\u672c\u4f53\u3068\u5168\u304f\u540c\u3058\u5f62\u306a\u306e\u3067\u3001 ...snip for (i = 0; i <= step; i++) { # create nodes in i-th step for (j = 0; j <= i; j++) q[j] = create(j); # create edges from (i-1)-th step to i-th step ...snip\u306e\u3088\u3046\u306bfor\u30eb\u30fc\u30d7\u3060\u3051\u306b\u307e\u3068\u3081\u3089\u308c\u308b\u3002 \u3067\u304d\u308b\u3060\u3051\u540c\u3058\u5f62\u3067\u547c\u3079\u2026","title":" Pascal\u306e\u4e09\u89d2\u5f62 #4","provider_name":"Hatena Blog","height":"190","published":"2011-10-18 00:00:00","type":"rich","version":"1.0","categories":["Graphviz"],"url":"https://quasistatic.hatenadiary.jp/entry/20111018/p1","blog_url":"https://quasistatic.hatenadiary.jp/"}