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

[GVS Akhil]

Hello everyone,

Here is the first-week report for my GSoC project.
Any feedback, comments and suggestions are welcome.

*Week 1 Report*

   - What did I complete this week?
      - Created a development branch named pgr_breadthFirstSearch which
      will be used to implement the pgr_breadthFirstSearch function.
      - Added C, C++ and SQL files to define the function signature. These
      files allow calling the function pgr_breadthFirstSearch() but return an
      empty result for now.
      - Added the framework for pgTap tests, inner query tests and crash
      tests.
      - Configured the Continuous Integration system named Travis to
      include the pgr_breadthFirstSearch function in it's builds.
      - Created a pull request [1].
   - What am I going to achieve for next week?
   - In the function's current state, It accepts the input data but does
      not process the data and will return an empty output. In the next week, I
      will be porting the Breadth First Search algorithm from the Boost C++
      Libraries to my development branch to process the input data.
   - Is there any blocking issue?
      - Currently, I do not have any blocking issue and will be able to
      begin coding the functionalities planned for the next week.

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

*Links*

   - [1] https://github.com/pgRouting/GSoC-pgRouting/pull/5
   - [2] https://github.com/vicennial/GSoC-pgRouting/
   - [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/20190602/29b07912/attachment.html>