[pgrouting-dev] GSoc'17 Weekly Report 10 - Rewrite of Turn Restricted Shortest Path Algorithm in pgRouting

Hi everyone,

I along with the mentors have decided to change the scope of the project.

New Scope

   1. Complete pgr_lineGraph along with the tests and documentation.
   2. At an experimentation level, change the dijkstra code to also
   consider costs on vertices and/or work on supporting costs on vertices on
   dijkstra queries.
   3. pgr_dijkstraTRSP becomes out of scope.


It turned out, that for making the proposal idea work, pgRouting needs some
functionality that it does not have currently.

   - I already have code for pgr_dijkstraTRSP that work when the path does
   not pass through a restriction.
   - I am in the process of making pgr_lineGraph for unweighted graphs.
   - pgr_lineGraphWeighted which considers weights on graphs.
   - Currently pgRouting supports dijkstra queries where only edges have
   costs and is missing support on costs with vertices.


   What did you get done this week?

   This week, I completed the documentation of pgr_lineGraph. Also, fixed a
   major bug in its implementation.
   - Details along with the commit log can be found in [1]
      - Set of pull requests can be found in [2]

   What am I going to achieve for next week?

   In the coming week, I'll be working on the implementation of Dijktra
   that considers costs on vertices.

   Details of possible sub tasks can be found in [3]

   Is there any blocking issue?

   No, I am not blocked currently.
   - The wiki page can be found in [4]
      - The repository can be found in [5]




   [4] https://github.com/pgRouting/pgrouting/wiki/GSoC-2017-Rewrite-TRSP

   [5] https://github.com/pgRouting/pgrouting/tree/gsoc/rewritetrsp

Vidhan Jain