[pgrouting-dev] [SoC][pgRouting] GSoC'18 Week 6 Report- Implement Bellman-ford and Parallel Dijkstra

Hi All,

This is my report for week 6 (June 18 - June 24)

What did you get done this week?

  • Change function’s name from pgrbellman_ford to pgr_bellmanFord.
  • Retrieving negative edges((or all edges) in boost graph.
  • Testing boost bellman-ford functionality
    Details can be found at [1] and PR at [2]

What do you plan on doing next week?

  • Implement the function to work with negative edges.

  • Refine function’s outputs and signature

  • Start working on the implementation of parallel Dijkstra algorithm(if time permits)
    Are you blocked on anything?
    No, I am not blocked.

THe wiki and repository can be found in [3] and [4] respectively.

[1] https://github.com/pgRouting/pgrouting/wiki/GSoC-2018-Parallel-Dijkstra-and-Bellman-Ford#week-6-18-june—24-june
[2] https://github.com/pgRouting/pgrouting/pull/1049
[3] https://github.com/pgRouting/pgrouting/wiki/GSoC-2018-Parallel-Dijkstra-and-Bellman-Ford
[4] https://github.com/pgRouting/pgrouting/tree/gsoc/bellmanford-one-to-one

Sourabh Garg
IIT BHU, India