{"action":"closed","issue":{"url":"https://api.github.com/repos/soniakeys/graph/issues/43","repository_url":"https://api.github.com/repos/soniakeys/graph","labels_url":"https://api.github.com/repos/soniakeys/graph/issues/43/labels{/name}","comments_url":"https://api.github.com/repos/soniakeys/graph/issues/43/comments","events_url":"https://api.github.com/repos/soniakeys/graph/issues/43/events","html_url":"https://github.com/soniakeys/graph/issues/43","id":143129012,"number":43,"title":"BellmanFord problems","user":{"login":"soniakeys","id":1660683,"avatar_url":"https://avatars.githubusercontent.com/u/1660683?v=3","gravatar_id":"","url":"https://api.github.com/users/soniakeys","html_url":"https://github.com/soniakeys","followers_url":"https://api.github.com/users/soniakeys/followers","following_url":"https://api.github.com/users/soniakeys/following{/other_user}","gists_url":"https://api.github.com/users/soniakeys/gists{/gist_id}","starred_url":"https://api.github.com/users/soniakeys/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/soniakeys/subscriptions","organizations_url":"https://api.github.com/users/soniakeys/orgs","repos_url":"https://api.github.com/users/soniakeys/repos","events_url":"https://api.github.com/users/soniakeys/events{/privacy}","received_events_url":"https://api.github.com/users/soniakeys/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":1,"created_at":"2016-03-24T02:24:01Z","updated_at":"2016-04-01T18:42:06Z","closed_at":"2016-04-01T18:42:06Z","body":"Doc says \"Negative cycles are only detected when reachable from start.  A negative cycle not reachable from start will not prevent the algorithm from finding shortest paths reachable from start.\"  That an awful lot of \"reachable from starts\"\r\n\r\nAlso, can cycles actually be identified and returned easily?"}}