{"height":"190","published":"2012-10-16 16:32:05","width":"100%","version":"1.0","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fapollo440.hatenablog.com%2Fentry%2F20121016%2F1350372725\" title=\" - apollo440\u2019s blog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"provider_url":"https://hatena.blog","title":"","categories":[".NET\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0",".NET\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0"],"blog_title":"apollo440\u2019s blog","author_name":"apollo440","provider_name":"Hatena Blog","blog_url":"https://apollo440.hatenablog.com/","url":"https://apollo440.hatenablog.com/entry/20121016/1350372725","description":"\u30c8\u30dd\u30ed\u30b8\u30ab\u30eb\u30bd\u30fc\u30c8\u3002\u3078\u3047\u301c Generic Topological Sort (C#) Wednesday, May 27th, 2009 at 07h53 A topological sort sorts out dependencies and returns an order in which each predecessor is processed before any of its successors.","author_url":"https://blog.hatena.ne.jp/apollo440/"}