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

[GVS Akhil]

Hello everyone,

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

*Week 8 Report*

   - What did I complete this week?
      - Added the following categories of pgTap tests for the Binary
      Breadth-First Search algorithm:
      - Inner Query Tests
            - Edge Case Tests
            - Parameter Type Checks
            - Crash Tests
            - Comparison Tests
         - Added function documentation page which also includes sample
      queries.
      - Modified method of displaying pre-processing error. (Previously
      used the 'assert' function to throw an error but have now
shifted to simply
      printing the error message and terminating the function execution.)
      - Created a pull request [1] and merged it.
   - What am I going to achieve for next week?
   - I will begin working on the last deliverable of my project, which is,
      implementing Edward Moore's Algorithm in pgRouting. I will be
designing the
      function definition as well as creating a basic skeleton of the
function's
      documentation and tests next week.
   - Is there any blocking issue?
      - No blocking issues.

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

*Links*

   - [1] https://github.com/pgRouting/GSoC-pgRouting/pull/20
   - [2]
   https://github.com/vicennial/GSoC-pgRouting/tree/pgr_binaryBreadthFirstSearch
   - [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/20190721/11543ccb/attachment.html>