<div dir="ltr"><img width="0" height="0" class="mailtrack-img" alt="" style="display:flex" src="https://mailtrack.io/trace/mail/80a204e859d93a71c4e8c86bf5dfd2dcf53c0553.png?u=439451"><div></div> <span style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial;float:none;display:inline">Hi All,</span><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial"><br></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial">This is my report for Week 9 (July 9 - July 15).</div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial"><br></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial"><b>What did you get done this week?</b><br><ul><li style="margin-left:15px">Implement dijkstra's shortest path algorithm on the distributed graph.</li><li style="margin-left:15px">Visualize Distributed graph with multiple processors[4].</li></ul><div>Details of PR can be found at [1].</div><div><br></div><b>What do you plan on doing next week?</b></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial"><ul><li style="margin-left:15px">Implement test regarding time performance over large graphs.</li><li style="margin-left:15px"><b><span style="font-size:12.8px;font-weight:400;background-color:rgb(255,255,255);text-decoration-style:initial;text-decoration-color:initial;float:none;display:inline">Implementing parallel_dijkstra functionality in pgRouting.</span></b></li></ul><div>Currently, I am not blocked.</div></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial"><br></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial">The project's wiki can be found at [3].</div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial"><br></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial">[1]. <a href="https://github.com/pgRouting/pgrouting/pull/1064" target="_blank" style="color:rgb(17,85,204)">https://github.com/pgRouting/pgrouting/pull/1064</a></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial">[2]. <a href="https://github.com/pgRouting/pgrouting/tree/gsoc/parallel-dijkstra" target="_blank" style="color:rgb(17,85,204)">https://github.com/<wbr>pgRouting/pgrouting/tree/gsoc/<wbr>parallel-dijkstra</a></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial">[3]. <a href="https://github.com/pgRouting/pgrouting/wiki/GSoC-2018-Parallel-Dijkstra-and-Bellman-Ford">https://github.com/<wbr>pgRouting/pgrouting/wiki/GSoC-<wbr>2018-Parallel-Dijkstra-and-<wbr>Bellman-Ford</a></div><div style="font-size:12.8px;text-decoration-style:initial;text-decoration-color:initial">[4]. <a href="https://github.com/pgRouting/pgrouting/blob/gsoc/parallel-dijkstra/src/parallel/Example_1/README.md">https://github.com/pgRouting/pgrouting/blob/gsoc/parallel-dijkstra/src/parallel/Example_1/README.md</a></div><br><div>Regards,</div><div><i>Sourabh Garg</i></div><div><i><br></i></div></div>