{"action":"created","issue":{"url":"https://api.github.com/repos/JuliaLang/Graphs.jl/issues/169","labels_url":"https://api.github.com/repos/JuliaLang/Graphs.jl/issues/169/labels{/name}","comments_url":"https://api.github.com/repos/JuliaLang/Graphs.jl/issues/169/comments","events_url":"https://api.github.com/repos/JuliaLang/Graphs.jl/issues/169/events","html_url":"https://github.com/JuliaLang/Graphs.jl/pull/169","id":57519882,"number":169,"title":"A Simple Min-Cut Algorithm","user":{"login":"bdeonovic","id":805168,"avatar_url":"https://avatars.githubusercontent.com/u/805168?v=3","gravatar_id":"","url":"https://api.github.com/users/bdeonovic","html_url":"https://github.com/bdeonovic","followers_url":"https://api.github.com/users/bdeonovic/followers","following_url":"https://api.github.com/users/bdeonovic/following{/other_user}","gists_url":"https://api.github.com/users/bdeonovic/gists{/gist_id}","starred_url":"https://api.github.com/users/bdeonovic/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/bdeonovic/subscriptions","organizations_url":"https://api.github.com/users/bdeonovic/orgs","repos_url":"https://api.github.com/users/bdeonovic/repos","events_url":"https://api.github.com/users/bdeonovic/events{/privacy}","received_events_url":"https://api.github.com/users/bdeonovic/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":23,"created_at":"2015-02-12T21:09:46Z","updated_at":"2015-02-17T13:15:08Z","closed_at":"2015-02-16T17:23:34Z","pull_request":{"url":"https://api.github.com/repos/JuliaLang/Graphs.jl/pulls/169","html_url":"https://github.com/JuliaLang/Graphs.jl/pull/169","diff_url":"https://github.com/JuliaLang/Graphs.jl/pull/169.diff","patch_url":"https://github.com/JuliaLang/Graphs.jl/pull/169.patch"},"body":"This is me responding to my feature request: https://github.com/JuliaLang/Graphs.jl/issues/168. An implementation that mirrors Boosts implementation of a simple min-cut algorithm\r\n\r\nStoer, Mechthild and Frank Wagner, “A simple min-cut algorithm”. Journal of the ACM 44 (4), 585-591, 1997. DOI: 10.1145/263867.263872\r\n\r\n\r\n"},"comment":{"url":"https://api.github.com/repos/JuliaLang/Graphs.jl/issues/comments/74665610","html_url":"https://github.com/JuliaLang/Graphs.jl/pull/169#issuecomment-74665610","issue_url":"https://api.github.com/repos/JuliaLang/Graphs.jl/issues/169","id":74665610,"user":{"login":"mlubin","id":1733683,"avatar_url":"https://avatars.githubusercontent.com/u/1733683?v=3","gravatar_id":"","url":"https://api.github.com/users/mlubin","html_url":"https://github.com/mlubin","followers_url":"https://api.github.com/users/mlubin/followers","following_url":"https://api.github.com/users/mlubin/following{/other_user}","gists_url":"https://api.github.com/users/mlubin/gists{/gist_id}","starred_url":"https://api.github.com/users/mlubin/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/mlubin/subscriptions","organizations_url":"https://api.github.com/users/mlubin/orgs","repos_url":"https://api.github.com/users/mlubin/repos","events_url":"https://api.github.com/users/mlubin/events{/privacy}","received_events_url":"https://api.github.com/users/mlubin/received_events","type":"User","site_admin":false},"created_at":"2015-02-17T13:15:08Z","updated_at":"2015-02-17T13:15:08Z","body":"No, I don't think so. That would just create a large mess in order to tidy up a small mess."}}