[SoC] Implement Edward Moore's Algorithm, Breadth First Search and Binary Breadth First Search Algorithms in pgRouting - Week 2 Report

[GVS Akhil]

Hello everyone,

Here is my second-week report for my GSoC project.
As usual, any feedback, comments and suggestions are welcome.

*Week 2 Report*

   - What did I complete this week?
      - Added the core algorithm(Boost's Breadth First Search) which works
      on the input data to provide the requested traversal order of
the graph in
      file pgr_breadthFirstSearch.hpp (C++ File).
      - Added the logic to transport the input SQL-type data to the
      implemented algorithm as well as the logic to process the algorithm's
      output data to an SQL-friendly format in file
breadthFirstSearch_driver.cpp.
      - Fixed minor typos in previous week's files.
      - Created a pull request [1] and merged it.
   - What am I going to achieve for next week?
   - I will be cleaning up all the files and code involved up till now by
      removing any unnecessary code, renaming variables and refactoring code
      where ever possible.
   - Is there any blocking issue?
      - None as of now.

Public Repository: [2]
Wiki page with all reports: [3]

*Links*

   - [1] https://github.com/pgRouting/GSoC-pgRouting/pull/8
   - [2]
   https://github.com/vicennial/GSoC-pgRouting/tree/pgr_breadthFirstSearch
   - [3]
   https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-Edward-Moore's-Algorithm,-Breadth-First-Search-and-Binary-Breadth-First-Search


Thank you,
GVS Akhil
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/soc/attachments/20190609/7ba84903/attachment.html>