[pgrouting-dev] [SoC][pgRouting] GSoC'18 Week 7 Report: Implement Bellman-ford and parallel-Dijkstra

Hi all,

This is my report for week 7(June25-July 1).

What did you get done this week?

  • Clean and Working pgr_bellmanFord for positive edges [1]

  • Create function’s signature for allowing negative edge sql query [2]

  • Building graph and applying algorithm with negative edges [3]
    Details and PR can be found at [4] and [5] respectively.

What do you plan on doing next week?

  • Start Experimenting with parallel boost graph library, creating some sample examples.
  • Implementing parallel functionality in pgRouting.
    Are you blocked on anything?

No, I am not blocked currently.

The wiki and repository can be found in [4] and [6].

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

Sourabh Garg