{"action":"created","issue":{"url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms/issues/134","repository_url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms","labels_url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms/issues/134/labels{/name}","comments_url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms/issues/134/comments","events_url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms/issues/134/events","html_url":"https://github.com/neo4j-contrib/neo4j-graph-algorithms/pull/134","id":228268882,"number":134,"title":"parallel Delta-stepping Non-negative Single Source Shortest Paths","user":{"login":"mknblch","id":5984656,"avatar_url":"https://avatars3.githubusercontent.com/u/5984656?v=3","gravatar_id":"","url":"https://api.github.com/users/mknblch","html_url":"https://github.com/mknblch","followers_url":"https://api.github.com/users/mknblch/followers","following_url":"https://api.github.com/users/mknblch/following{/other_user}","gists_url":"https://api.github.com/users/mknblch/gists{/gist_id}","starred_url":"https://api.github.com/users/mknblch/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/mknblch/subscriptions","organizations_url":"https://api.github.com/users/mknblch/orgs","repos_url":"https://api.github.com/users/mknblch/repos","events_url":"https://api.github.com/users/mknblch/events{/privacy}","received_events_url":"https://api.github.com/users/mknblch/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2017-05-12T11:51:10Z","updated_at":"2017-05-12T23:29:28Z","closed_at":"2017-05-12T21:20:37Z","pull_request":{"url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms/pulls/134","html_url":"https://github.com/neo4j-contrib/neo4j-graph-algorithms/pull/134","diff_url":"https://github.com/neo4j-contrib/neo4j-graph-algorithms/pull/134.diff","patch_url":"https://github.com/neo4j-contrib/neo4j-graph-algorithms/pull/134.patch"},"body":"This is an alternative algorithm for shortest paths. According to different papers it's parallel performance is better then parallel-dfs implementations so I gave it a try.\r\n\r\nThe deltaStepping algorithm can be tweaked with the delta parameter ([more](https://ae.cs.uni-frankfurt.de/pdf/diss_uli.pdf)).\r\n\r\nBased on this implementation we can build parallel centrality measurement algorithms easily. \r\n\r\nTODO:\r\n- edge case tests\r\n- benchmark"},"comment":{"url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms/issues/comments/301207668","html_url":"https://github.com/neo4j-contrib/neo4j-graph-algorithms/pull/134#issuecomment-301207668","issue_url":"https://api.github.com/repos/neo4j-contrib/neo4j-graph-algorithms/issues/134","id":301207668,"user":{"login":"jexp","id":67427,"avatar_url":"https://avatars2.githubusercontent.com/u/67427?v=3","gravatar_id":"","url":"https://api.github.com/users/jexp","html_url":"https://github.com/jexp","followers_url":"https://api.github.com/users/jexp/followers","following_url":"https://api.github.com/users/jexp/following{/other_user}","gists_url":"https://api.github.com/users/jexp/gists{/gist_id}","starred_url":"https://api.github.com/users/jexp/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jexp/subscriptions","organizations_url":"https://api.github.com/users/jexp/orgs","repos_url":"https://api.github.com/users/jexp/repos","events_url":"https://api.github.com/users/jexp/events{/privacy}","received_events_url":"https://api.github.com/users/jexp/received_events","type":"User","site_admin":false},"created_at":"2017-05-12T23:29:28Z","updated_at":"2017-05-12T23:29:28Z","body":"@mknblch is this ready to be merged?"}}
{"actor":{"display_login":"jexp"}}