<div dir="ltr"><div dir="ltr"><div dir="ltr"><div>Hello Everyone,</div><div><br></div><div>My name is Gudesa Venkata Sai Akhil. I go by the handle 'Vicennial' on most online platforms.</div><div>I am a third-year undergraduate at IIT Indore pursuing a bachelors degree in computer science and engineering.  </div><div><br></div><div>My project is "Implement Edward Moore's Algorithm, Breadth First Search and Binary Breadth First Search Algorithms in pgRouting" [1]. </div><div>Implementing Edward Moore's Algorithm will enable pgRouting to efficiently calculate minimum cost paths in graphs containing negative edge weights.   </div><div>I would also port the Breadth First Search algorithm from the C++ Boost Graph Library as well as implement an interesting variation of the algorithm known as Binary Breadth First Search.</div><div><br></div><div>I will be implementing these algorithms in a GitHub fork [2] of pgRouting's GSoC-pgRouting repository [3]. The project wiki [4] would contain weekly reports of my progress.</div><div><br></div><div>The detailed project proposal [5] further explains the algorithms, their significance and proposed use. </div><div>Any comments, feedback and suggestions are welcome and would prove invaluable to me for the successful completion of my project. </div><div><br></div><div>Last but not least, I want to thank the OSGeo community as well as the pgRouting community for allowing me the opportunity to implement the proposed project. It is an exciting experience for me since this would be my first GSoC participation as well as the first open source project to which I would be actively contributing code.</div><div><br></div><div>Thank you,</div><div>GVS Akhil</div><div><br></div><div>[1] <a href="https://summerofcode.withgoogle.com/projects/#5188028799123456">https://summerofcode.withgoogle.com/projects/#5188028799123456 </a></div><div>[2] <a href="https://github.com/vicennial/GSoC-pgRouting">https://github.com/vicennial/GSoC-pgRouting</a></div><div>[3] <a href="https://github.com/pgRouting/GSoC-pgRouting">https://github.com/pgRouting/GSoC-pgRouting</a></div><div>[4] <a href="https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-Edward-Moore's-Algorithm,-Breadth-First-Search-and-Binary-Breadth-First-Search">https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-Edward-Moore's-Algorithm,-Breadth-First-Search-and-Binary-Breadth-First-Search</a>   <br></div><div>[5] <a href="https://docs.google.com/document/d/1OVr--A5up9xev2IPlkEzcXRkxOrnj-zaGCRYNXhY_mE/edit?usp=sharing">https://docs.google.com/document/d/1OVr--A5up9xev2IPlkEzcXRkxOrnj-zaGCRYNXhY_mE/edit?usp=sharing</a></div><div><br></div></div></div><div></div><span><img alt="" width="1" height="1" src="https://gml.email/v3.2/t/image/MTU1NzUwMjk3OTdkYTc1Mjk1MmZjNDA3NGMxMDFlNGEyNDllNDM1ODhjJmd2cy5ha2hpbDE5OTdAZ21haWwuY29tJnNvY0BsaXN0cy5vc2dlby5vcmc.gif" id="gml-gvs.akhil1997@gmail.com1557509653"></span></div>