{"action":"created","issue":{"url":"https://api.github.com/repos/Project-OSRM/osrm-backend/issues/2189","repository_url":"https://api.github.com/repos/Project-OSRM/osrm-backend","labels_url":"https://api.github.com/repos/Project-OSRM/osrm-backend/issues/2189/labels{/name}","comments_url":"https://api.github.com/repos/Project-OSRM/osrm-backend/issues/2189/comments","events_url":"https://api.github.com/repos/Project-OSRM/osrm-backend/issues/2189/events","html_url":"https://github.com/Project-OSRM/osrm-backend/issues/2189","id":145172938,"number":2189,"title":"Range analysis plugin","user":{"login":"roroettg","id":2581761,"avatar_url":"https://avatars.githubusercontent.com/u/2581761?v=3","gravatar_id":"","url":"https://api.github.com/users/roroettg","html_url":"https://github.com/roroettg","followers_url":"https://api.github.com/users/roroettg/followers","following_url":"https://api.github.com/users/roroettg/following{/other_user}","gists_url":"https://api.github.com/users/roroettg/gists{/gist_id}","starred_url":"https://api.github.com/users/roroettg/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/roroettg/subscriptions","organizations_url":"https://api.github.com/users/roroettg/orgs","repos_url":"https://api.github.com/users/roroettg/repos","events_url":"https://api.github.com/users/roroettg/events{/privacy}","received_events_url":"https://api.github.com/users/roroettg/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/Project-OSRM/osrm-backend/labels/Discussion","name":"Discussion","color":"444444"}],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":3,"created_at":"2016-04-01T12:48:55Z","updated_at":"2016-04-05T14:28:42Z","closed_at":null,"body":"Hello,\r\n\r\nI am currently working on a plugin, which should be giving me all ways from a starting point within a given distance. I have worked my way through the code and read about Contraction Hierarchies, but I have still no clue if or how i can implement it.\r\n\r\nAs far as I know every algorithm already implemented to solve the shortest path problem uses a bidirectional Dijkstra. In my case I think the best way to solve the problem is a normal Dijkstra, but i could not find any information if Contration Hierarchies are able to be used that way. \r\n\r\nAny hints or ideas where to start are greatly appreciated.\r\n\r\n\r\n\r\n\r\n"},"comment":{"url":"https://api.github.com/repos/Project-OSRM/osrm-backend/issues/comments/205833424","html_url":"https://github.com/Project-OSRM/osrm-backend/issues/2189#issuecomment-205833424","issue_url":"https://api.github.com/repos/Project-OSRM/osrm-backend/issues/2189","id":205833424,"user":{"login":"roroettg","id":2581761,"avatar_url":"https://avatars.githubusercontent.com/u/2581761?v=3","gravatar_id":"","url":"https://api.github.com/users/roroettg","html_url":"https://github.com/roroettg","followers_url":"https://api.github.com/users/roroettg/followers","following_url":"https://api.github.com/users/roroettg/following{/other_user}","gists_url":"https://api.github.com/users/roroettg/gists{/gist_id}","starred_url":"https://api.github.com/users/roroettg/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/roroettg/subscriptions","organizations_url":"https://api.github.com/users/roroettg/orgs","repos_url":"https://api.github.com/users/roroettg/repos","events_url":"https://api.github.com/users/roroettg/events{/privacy}","received_events_url":"https://api.github.com/users/roroettg/received_events","type":"User","site_admin":false},"created_at":"2016-04-05T14:28:42Z","updated_at":"2016-04-05T14:28:42Z","body":"Thank you very much. \r\n\r\nI will keep this updated, once i have some results to show. :-)"}}