{"action":"created","issue":{"url":"https://api.github.com/repos/algb12/GraphDS/issues/4","repository_url":"https://api.github.com/repos/algb12/GraphDS","labels_url":"https://api.github.com/repos/algb12/GraphDS/issues/4/labels{/name}","comments_url":"https://api.github.com/repos/algb12/GraphDS/issues/4/comments","events_url":"https://api.github.com/repos/algb12/GraphDS/issues/4/events","html_url":"https://github.com/algb12/GraphDS/issues/4","id":191195260,"number":4,"title":"Possibly add a few shortest path algos, DFS and BFS??","user":{"login":"algb12","id":14280579,"avatar_url":"https://avatars.githubusercontent.com/u/14280579?v=3","gravatar_id":"","url":"https://api.github.com/users/algb12","html_url":"https://github.com/algb12","followers_url":"https://api.github.com/users/algb12/followers","following_url":"https://api.github.com/users/algb12/following{/other_user}","gists_url":"https://api.github.com/users/algb12/gists{/gist_id}","starred_url":"https://api.github.com/users/algb12/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/algb12/subscriptions","organizations_url":"https://api.github.com/users/algb12/orgs","repos_url":"https://api.github.com/users/algb12/repos","events_url":"https://api.github.com/users/algb12/events{/privacy}","received_events_url":"https://api.github.com/users/algb12/received_events","type":"User","site_admin":false},"labels":[{"id":485254687,"url":"https://api.github.com/repos/algb12/GraphDS/labels/enhancement","name":"enhancement","color":"84b6eb","default":true},{"id":485254688,"url":"https://api.github.com/repos/algb12/GraphDS/labels/help%20wanted","name":"help wanted","color":"128A0C","default":true},{"id":485254690,"url":"https://api.github.com/repos/algb12/GraphDS/labels/question","name":"question","color":"cc317c","default":true}],"state":"open","locked":false,"assignee":{"login":"algb12","id":14280579,"avatar_url":"https://avatars.githubusercontent.com/u/14280579?v=3","gravatar_id":"","url":"https://api.github.com/users/algb12","html_url":"https://github.com/algb12","followers_url":"https://api.github.com/users/algb12/followers","following_url":"https://api.github.com/users/algb12/following{/other_user}","gists_url":"https://api.github.com/users/algb12/gists{/gist_id}","starred_url":"https://api.github.com/users/algb12/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/algb12/subscriptions","organizations_url":"https://api.github.com/users/algb12/orgs","repos_url":"https://api.github.com/users/algb12/repos","events_url":"https://api.github.com/users/algb12/events{/privacy}","received_events_url":"https://api.github.com/users/algb12/received_events","type":"User","site_admin":false},"assignees":[{"login":"algb12","id":14280579,"avatar_url":"https://avatars.githubusercontent.com/u/14280579?v=3","gravatar_id":"","url":"https://api.github.com/users/algb12","html_url":"https://github.com/algb12","followers_url":"https://api.github.com/users/algb12/followers","following_url":"https://api.github.com/users/algb12/following{/other_user}","gists_url":"https://api.github.com/users/algb12/gists{/gist_id}","starred_url":"https://api.github.com/users/algb12/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/algb12/subscriptions","organizations_url":"https://api.github.com/users/algb12/orgs","repos_url":"https://api.github.com/users/algb12/repos","events_url":"https://api.github.com/users/algb12/events{/privacy}","received_events_url":"https://api.github.com/users/algb12/received_events","type":"User","site_admin":false}],"milestone":null,"comments":2,"created_at":"2016-11-23T06:11:09Z","updated_at":"2016-12-16T08:24:54Z","closed_at":null,"body":"I will consider this on demand, or is this library better kept simple? But something like Djikstra shouldn't bloat it up too much..."},"comment":{"url":"https://api.github.com/repos/algb12/GraphDS/issues/comments/267542090","html_url":"https://github.com/algb12/GraphDS/issues/4#issuecomment-267542090","issue_url":"https://api.github.com/repos/algb12/GraphDS/issues/4","id":267542090,"user":{"login":"algb12","id":14280579,"avatar_url":"https://avatars.githubusercontent.com/u/14280579?v=3","gravatar_id":"","url":"https://api.github.com/users/algb12","html_url":"https://github.com/algb12","followers_url":"https://api.github.com/users/algb12/followers","following_url":"https://api.github.com/users/algb12/following{/other_user}","gists_url":"https://api.github.com/users/algb12/gists{/gist_id}","starred_url":"https://api.github.com/users/algb12/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/algb12/subscriptions","organizations_url":"https://api.github.com/users/algb12/orgs","repos_url":"https://api.github.com/users/algb12/repos","events_url":"https://api.github.com/users/algb12/events{/privacy}","received_events_url":"https://api.github.com/users/algb12/received_events","type":"User","site_admin":false},"created_at":"2016-12-16T08:24:54Z","updated_at":"2016-12-16T08:24:54Z","body":"Added Floyd-Warshall shortest path algorithm"}}
{"actor":{"display_login":"algb12"}}