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

Hi All,

This is my report for Week 5 (June 11 - June 17).

What did you get done this week?

  • Implement code to work bellman-ford function for all signature’s variants.[1]
  • Add Files in the Documentation directory.[1]
  • Discuss and read about reading negative weight edges in pgRouting.
    PR: https://github.com/pgRouting/pgrouting/pull/1043

What do you plan on doing next week?

  • Implement functions for reading and accepting negative weights edges, to be used for the bellman_ford function.
  • Add some unit tests for those functions.
    Are you blocked on anything?
    No, I am not blocked.

Link to Project’s Wiki and Repository at [2] and [3] resp.

[1]. https://github.com/pgRouting/pgrouting/pull/1043
[2]. https://github.com/pgRouting/pgrouting/wiki/GSoC-2018-Parallel-Dijkstra-and-Bellman-Ford
[3]. https://github.com/pgRouting/pgrouting/tree/gsoc/bellmanford-one-to-one

Sourabh Garg
IIT BHU, India