[pgrouting-dev] [SoC] [ pgRouting] [GSoC' 18] Week 9 Report- Implement parallel dijkstra in pgRouting

Hi All,

This is my report for Week 9 (July 9 - July 15).

What did you get done this week?

  • Implement dijkstra’s shortest path algorithm on the distributed graph.
  • Visualize Distributed graph with multiple processors[4].
    Details of PR can be found at [1].

What do you plan on doing next week?

  • Implement test regarding time performance over large graphs.
  • Implementing parallel_dijkstra functionality in pgRouting.
    Currently, I am not blocked.

The project’s wiki can be found at [3].

[1]. https://github.com/pgRouting/pgrouting/pull/1064
[2]. https://github.com/pgRouting/pgrouting/tree/gsoc/parallel-dijkstra
[3]. https://github.com/pgRouting/pgrouting/wiki/GSoC-2018-Parallel-Dijkstra-and-Bellman-Ford
[4]. https://github.com/pgRouting/pgrouting/blob/gsoc/parallel-dijkstra/src/parallel/Example_1/README.md

Sourabh Garg