<div dir="ltr">Hello everyone,<div><br></div><div>Here is the fourth-week report for my GSoC project.  <br>Any feedback, comments and suggestions are welcome.</div><div><br></div><div><b>Week 4 Report</b><br><ul><li style="margin-left:15px">What did I complete this week?</li><ul><li style="margin-left:15px">Added a negative value check on the 'max_depth' input parameter of the pgr_breadthFirstSearch function. An error is thrown to the user instead of displaying an empty result.</li><li style="margin-left:15px">Modified the implemented algorithm to return the traversal starting at depth zero instead of depth one. This was done to avoid empty output when the input graph contains only a single vertex which is also the source vertex in the function call.</li><li style="margin-left:15px">Modified the implemented algorithm to return an empty table when the source vertex is not present in the input graph.</li><li style="margin-left:15px">Added function input/output parameter type-check pgTap tests.<br></li><li style="margin-left:15px">Added algorithm edge-cases pgTap tests.<br></li><li style="margin-left:15px">Added additional inner-query pgTap tests.<br></li><li style="margin-left:15px">Added more example queries and their results in the function's documentation page.<br></li><li style="margin-left:15px">Created a pull request [1] and merged it. </li></ul><li style="margin-left:15px">What am I going to achieve for next week?<br></li><ul><li style="margin-left:15px">I will begin working on the next deliverable of my project, which is, implementing the Binary Breadth First Search 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.</li></ul><li style="margin-left:15px">Is there any blocking issue?</li><ul><li style="margin-left:15px">No blocking issues.<br></li></ul></ul>Public Repository: [2]<br>Wiki page with all reports: [3]<br></div><div><br></div><div><b>Links</b></div><div><ul><li style="margin-left:15px">[1] <a href="https://github.com/pgRouting/GSoC-pgRouting/pull/12" target="_blank">https://github.com/pgRouting/GSoC-pgRouting/pull/12</a></li><li style="margin-left:15px">[2] <a href="https://github.com/vicennial/GSoC-pgRouting/tree/pgr_breadthFirstSearch" target="_blank">https://github.com/vicennial/GSoC-pgRouting/tree/pgr_breadthFirstSearch</a></li><li style="margin-left:15px">[3] <a href="https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-Edward-Moore's-Algorithm,-Breadth-First-Search-and-Binary-Breadth-First-Search" target="_blank">https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-Edward-Moore's-Algorithm,-Breadth-First-Search-and-Binary-Breadth-First-Search</a></li></ul><div><br></div></div><div>Thank you,<br></div><div>GVS Akhil</div><div></div><span><img alt="" width="1" height="1" src="https://gml.email/v3.2/t/image/MTU2MTI5MzM5NjdkYTc1Mjk1MmZjNDA3NGMxMDFlNGEyNDllNDM1ODhjJmd2cy5ha2hpbDE5OTdAZ21haWwuY29tJnNvY0BsaXN0cy5vc2dlby5vcmc.gif" id="gml-gvs.akhil1997@gmail.com1561295152"></span></div>