{"action":"created","issue":{"url":"https://api.github.com/repos/scijs/contributing/issues/11","repository_url":"https://api.github.com/repos/scijs/contributing","labels_url":"https://api.github.com/repos/scijs/contributing/issues/11/labels{/name}","comments_url":"https://api.github.com/repos/scijs/contributing/issues/11/comments","events_url":"https://api.github.com/repos/scijs/contributing/issues/11/events","html_url":"https://github.com/scijs/contributing/issues/11","id":60003371,"number":11,"title":"Graph algorithms","user":{"login":"mikolalysenko","id":231686,"avatar_url":"https://avatars.githubusercontent.com/u/231686?v=3","gravatar_id":"","url":"https://api.github.com/users/mikolalysenko","html_url":"https://github.com/mikolalysenko","followers_url":"https://api.github.com/users/mikolalysenko/followers","following_url":"https://api.github.com/users/mikolalysenko/following{/other_user}","gists_url":"https://api.github.com/users/mikolalysenko/gists{/gist_id}","starred_url":"https://api.github.com/users/mikolalysenko/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/mikolalysenko/subscriptions","organizations_url":"https://api.github.com/users/mikolalysenko/orgs","repos_url":"https://api.github.com/users/mikolalysenko/repos","events_url":"https://api.github.com/users/mikolalysenko/events{/privacy}","received_events_url":"https://api.github.com/users/mikolalysenko/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":4,"created_at":"2015-03-05T19:32:15Z","updated_at":"2016-02-17T18:25:48Z","closed_at":null,"body":"There is a lot of stuff on npm, but even more big pieces are still missing.  Specifically, there still isn't anything good for doing network flow.  Ideally, it would be nice to have multiple algorithms:\r\n\r\n* Ford-Fulkerson\r\n* Push-relabel\r\n* Network simplex\r\n* etc.\r\n\r\nAlso as a supplement, having some solutions to the [min-cost variant](http://en.wikipedia.org/wiki/Minimum-cost_flow_problem) would be cool too.\r\n\r\nIt would also be nice to have some tools for computing approximations to various NP-hard graph problems like tree decomposition, clique finding, and so on."},"comment":{"url":"https://api.github.com/repos/scijs/contributing/issues/comments/185337372","html_url":"https://github.com/scijs/contributing/issues/11#issuecomment-185337372","issue_url":"https://api.github.com/repos/scijs/contributing/issues/11","id":185337372,"user":{"login":"rreusser","id":572717,"avatar_url":"https://avatars.githubusercontent.com/u/572717?v=3","gravatar_id":"","url":"https://api.github.com/users/rreusser","html_url":"https://github.com/rreusser","followers_url":"https://api.github.com/users/rreusser/followers","following_url":"https://api.github.com/users/rreusser/following{/other_user}","gists_url":"https://api.github.com/users/rreusser/gists{/gist_id}","starred_url":"https://api.github.com/users/rreusser/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/rreusser/subscriptions","organizations_url":"https://api.github.com/users/rreusser/orgs","repos_url":"https://api.github.com/users/rreusser/repos","events_url":"https://api.github.com/users/rreusser/events{/privacy}","received_events_url":"https://api.github.com/users/rreusser/received_events","type":"User","site_admin":false},"created_at":"2016-02-17T18:25:48Z","updated_at":"2016-02-17T18:25:48Z","body":"Don't want to get ahead of you in case it's the direction you're headed (I seem .travis.yml), sooner or later it would very helpful to translate the examples into tests. Beyond superficial things though, I'll need to better familiarize myself with these algorithms before I can provide any meaningful feedback."}}