{"action":"created","issue":{"url":"https://api.github.com/repos/paultag/go-topsort/issues/3","repository_url":"https://api.github.com/repos/paultag/go-topsort","labels_url":"https://api.github.com/repos/paultag/go-topsort/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/paultag/go-topsort/issues/3/comments","events_url":"https://api.github.com/repos/paultag/go-topsort/issues/3/events","html_url":"https://github.com/paultag/go-topsort/issues/3","id":157409117,"number":3,"title":"Stable Sort?","user":{"login":"tianon","id":161631,"avatar_url":"https://avatars.githubusercontent.com/u/161631?v=3","gravatar_id":"","url":"https://api.github.com/users/tianon","html_url":"https://github.com/tianon","followers_url":"https://api.github.com/users/tianon/followers","following_url":"https://api.github.com/users/tianon/following{/other_user}","gists_url":"https://api.github.com/users/tianon/gists{/gist_id}","starred_url":"https://api.github.com/users/tianon/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/tianon/subscriptions","organizations_url":"https://api.github.com/users/tianon/orgs","repos_url":"https://api.github.com/users/tianon/repos","events_url":"https://api.github.com/users/tianon/events{/privacy}","received_events_url":"https://api.github.com/users/tianon/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":2,"created_at":"2016-05-29T22:16:46Z","updated_at":"2016-05-29T22:30:17Z","closed_at":null,"body":"Would it be possible to have a \"stable\" version of `Sort`? (ie. prefer the order nodes were created provided no edges interfere)\r\n\r\nIn looking at the code, it _seems_ like `map` is the only construct that makes it not stable currently, but I'm not sure whether I'm actually reading the algorithm correctly."},"comment":{"url":"https://api.github.com/repos/paultag/go-topsort/issues/comments/222386620","html_url":"https://github.com/paultag/go-topsort/issues/3#issuecomment-222386620","issue_url":"https://api.github.com/repos/paultag/go-topsort/issues/3","id":222386620,"user":{"login":"tianon","id":161631,"avatar_url":"https://avatars.githubusercontent.com/u/161631?v=3","gravatar_id":"","url":"https://api.github.com/users/tianon","html_url":"https://github.com/tianon","followers_url":"https://api.github.com/users/tianon/followers","following_url":"https://api.github.com/users/tianon/following{/other_user}","gists_url":"https://api.github.com/users/tianon/gists{/gist_id}","starred_url":"https://api.github.com/users/tianon/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/tianon/subscriptions","organizations_url":"https://api.github.com/users/tianon/orgs","repos_url":"https://api.github.com/users/tianon/repos","events_url":"https://api.github.com/users/tianon/events{/privacy}","received_events_url":"https://api.github.com/users/tianon/received_events","type":"User","site_admin":false},"created_at":"2016-05-29T22:30:17Z","updated_at":"2016-05-29T22:30:17Z","body":"I can say for sure that with that patch applied, the output I'm getting is putting all the root-level nodes first, followed by all nodes from the next level, in the order that I added them."}}
{"actor":{"display_login":"tianon"}}