<div dir="ltr">Hello everyone,<div><br></div><div>Here is the tenth-week report for my GSoC project.  <br>Any feedback, comments and suggestions are welcome.</div><div><br></div><div><b>Week 10 Report</b><br><ul><li style="margin-left:15px">What did I complete this week?</li><ul><li style="margin-left:15px">Created C++ file which contains the core algorithm and linked the file to the pgr_edwardMoore function.</li><li style="margin-left:15px">Added a simple, base version of the target algorithm which is able to calculate the correct path as well as the cost between two nodes in a graph containing only edges with a non-negative cost.</li><li style="margin-left:15px">Code lint fixes, quality checks and file reorganization in preparation for code deployment. (Changes currently not visible in PR)</li><li style="margin-left:15px">Created a pull request [2] 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 aim to have the full implementation of the target algorithm ready. In the final state, the algorithm will be able to work on graphs containing edges of any cost value.</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/25" target="_blank">https://github.com/pgRouting/GSoC-pgRouting/pull/25</a></li><li style="margin-left:15px">[2] <a href="https://github.com/vicennial/GSoC-pgRouting/tree/pgr_edwardMoore" target="_blank">https://github.com/vicennial/GSoC-pgRouting/tree/pgr_edwardMoore</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/VUlEfGFiYTk3MTBjLTVkMzktNDU1OS04YjgzLTZlMTViN2UyMjZmZnxzb2NAbGlzdHMub3NnZW8ub3Jn.gif" id="gml-gvs.akhil1997@gmail.com1564941118"></span></div>