<div dir="ltr">Hello everyone,<div><br></div><div>Here is the seventh-week report for my GSoC project.  <br>Any feedback, comments and suggestions are welcome.</div><div><br></div><div><b>Week 7 Report</b><br><ul><li style="margin-left:15px">What did I complete this week?</li><ul><li style="margin-left:15px">Added path-cost calculation to the algorithm.</li><li style="margin-left:15px">Replaced usage of a C++ STL map container with a C++ STL vector container. (Vector container has a lower runtime complexity compared to map container for accessing stored elements)</li><li style="margin-left:15px">Refactored the path-generation and cost-calculation sections of the algorithm into multiple, easy-to-read modules.</li><li style="margin-left:15px">Added a pre-processing check that verifies that the input graph satisfies the restrictions set by the algorithm which are required to be followed for successful execution. An error is thrown if restrictions are not met.</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">In the following week, I plan to write tests as well as documentation for the algorithm. By the end of the week, I aim to have the algorithm be in a ready-to-implement state with all relevant work completed before moving on to the next deliverable of my project in the third coding period.</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/18" target="_blank">https://github.com/pgRouting/GSoC-pgRouting/pull/18</a></li><li style="margin-left:15px">[2] <a href="https://github.com/vicennial/GSoC-pgRouting/tree/pgr_binaryBreadthFirstSearch" target="_blank">https://github.com/vicennial/GSoC-pgRouting/tree/pgr_binaryBreadthFirstSearch</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/VUlEfGEyNTUzM2RkLTkwZTUtNDI2Zi1hYzEwLWQyMDI1OTkxYmY2M3xzb2NAbGlzdHMub3NnZW8ub3Jn.gif" id="gml-gvs.akhil1997@gmail.com1563112782"></span></div>