<div dir="ltr">
<div>Thanks for your final report.</div><div><br></div><div>Helmut on behalf of the OSGeo GSoC admins</div>

</div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">Am Mo., 26. Aug. 2019 um 01:50 Uhr schrieb Hang Wu <<a href="mailto:wuhang212@126.com">wuhang212@126.com</a>>:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div style="line-height:1.7;color:rgb(0,0,0);font-size:14px;font-family:Arial"><div style="line-height:1.7"><div style="line-height:1.7"><div style="line-height:1.7"><div style="line-height:1.7"><pre><font face="Arial">Hi all,

My name is Hang Wu. And this is my final report for my GSoC project. :)

*Title:*  GSoC 2019 GRAPH C Boost graph algorithms for pgRouting

*Organization:* pgRouting under OSGeo

*Abstract:*
My project will focus on implementing:
 - topological sort. Topological sort is a sorting algorithm. It is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.
 - transitive closure. The concept of transitive closure can be thought of as constructing a data structure that makes it possible to answer reachability questions. That is, can one get from node a to node d in one or more hops? A binary relation tells you only that node a is connected to node b, and that node b is connected to node c, etc.
By using C Boost graph algorithms, these problems can be solved with lesser time complexity. I have added Topological Sort algorithm and Transitive Closure algorithms to pgRouting during this GSoC period.

*Implemented functions:*
   - *pgr_topologicalSort*
   - *pgr_transitiveClosure*

*State of the art before the project:* PgRouting didn't have above functionalities before my GSoC.

*Addition that my project brought to pgRouting:*
The deliverables are code, documentation, documentation tests, pgTap of above functions.

*Future Directions:*
   - Due to time constraints, the mentors decided that the third planned function was not to be developed. But the two developed functions are going to be included in the next release of pgRouting as experimental functions.
   - Design the third function, pgr_lengauer_tarjan_dominator_tree().

*Links:*
   - *Wiki:*
   <a href="https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-GRAPH-C---Boost-graph-algorithms-for-pgRouting" target="_blank">https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-GRAPH-C---Boost-graph-algorithms-for-pgRouting</a>
   - *Last Pull Request:* <a href="https://github.com/pgRouting/pgrouting/pull/1238" target="_blank">https://github.com/pgRouting/pgrouting/pull/1238</a>
   - *Code Documentation:*
      - Topological Sort (pgr_topologicalSort) - <a href="http://docs.pgrouting.org/dev/en/pgr_topologicalSort.html" target="_blank">http://docs.pgrouting.org/dev/en/pgr_topologicalSort.html</a>
      - Transitive Closure (pgr_transitiveClosure) - <a href="http://docs.pgrouting.org/dev/en/pgr_transitiveClosure.html" target="_blank">http://docs.pgrouting.org/dev/en/pgr_transitiveClosure.html</a>
   - *Slide:* <a href="https://docs.google.com/presentation/d/e/2PACX-1vSz6R0yP5qCcVA8hdV6eE_okREzebolAJ95Oq5AvRFmn_I9SMd_kFVvz3HpuQP6_nL28c3PfL5XQyeO/pub?start=false&loop=false&delayms=3000" target="_blank">https://docs.google.com/presentation/d/e/2PACX-1vSz6R0yP5qCcVA8hdV6eE_okREzebolAJ95Oq5AvRFmn_I9SMd_kFVvz3HpuQP6_nL28c3PfL5XQyeO/pub?start=false&loop=false&delayms=3000</a>
   - *Tag:* <a href="https://github.com/pgRouting/GSoC-pgRouting/releases/tag/GSoC-nike0good-2019" target="_blank">https://github.com/pgRouting/GSoC-pgRouting/releases/tag/GSoC-nike0good-2019</a>
   - *Video:* <a href="https://www.youtube.com/watch?v=NnlXh0gB3yg" target="_blank">https://www.youtube.com/watch?v=NnlXh0gB3yg</a>
   - *Image:* <a href="https://drive.google.com/file/d/1OecaowmgdcRP97zH9eQwt3zkO4Ov_Shw/view" target="_blank">https://drive.google.com/file/d/1OecaowmgdcRP97zH9eQwt3zkO4Ov_Shw/view</a>

I am so glad to have such an interesting and exciting adventure with all of you. Thanks for all your support! I will be happy if my codes help you.

Best Regards,
Hang Wu</font></pre></div></div></div></div></div><br><br><span title="neteasefooter"><p> </p></span>_______________________________________________<br>
SoC mailing list<br>
<a href="mailto:SoC@lists.osgeo.org" target="_blank">SoC@lists.osgeo.org</a><br>
<a href="https://lists.osgeo.org/mailman/listinfo/soc" rel="noreferrer" target="_blank">https://lists.osgeo.org/mailman/listinfo/soc</a></blockquote></div>