<div dir="ltr">Hello everyone,<div><br></div><div>Here is the sixth-week report for my GSoC project.  <br>Any feedback, comments and suggestions are welcome.</div><div><br></div><div><b>Week 6 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_binaryBreadthFirstSearch function.<br></li><li style="margin-left:15px">Studied graph representation in Boost, particularly about vertices and edge [1] representation.</li><li style="margin-left:15px">Added a simple, base version of the target algorithm which is able to calculate the correct path between two nodes in the graph in its current state.</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. This would include correcting the cost-calculation step, pre-processing checks, elimination of code inefficiencies, refactoring and more.</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: [3]<br>Wiki page with all reports: [4]<br></div><div><br></div><div><b>Links</b></div><div><ul><li style="margin-left:15px">[1] <a href="https://theboostcpplibraries.com/boost.graph-vertices-and-edges">https://theboostcpplibraries.com/boost.graph-vertices-and-edges</a></li><li style="margin-left:15px">[2] <a href="https://github.com/pgRouting/GSoC-pgRouting/pull/17" target="_blank">https://github.com/pgRouting/GSoC-pgRouting/pull/17</a></li><li style="margin-left:15px">[3] <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">[4] <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/MTU2MjUxMzExMDdkYTc1Mjk1MmZjNDA3NGMxMDFlNGEyNDllNDM1ODhjJmd2cy5ha2hpbDE5OTdAZ21haWwuY29tJnNvY0BsaXN0cy5vc2dlby5vcmc.gif" id="gml-gvs.akhil1997@gmail.com1562513833"></span></div>