Hi,<br><br>Weekly Report #11<br>Date - 12th Aug 2011<br><br>Current Progress.<br>---------------------------------------------------------------------------------------------------------------------------------------------------------<br>
I completed the APSP algorithm and removed a few bugs and problems that were present in the previous draft.<br>Updated the github repository, I also wrote a tutorial to get started, run and test the algorithm. [2].<br><br>
For TDSP algorithm, I polished the code, added comments etc. Also, I wrote a plsql data generator function that generates random time dependent data corresponding to the ways table. It demonstrates the tdsp algorithm in a better way. I have added the plsql function to github repo too. [3].<br>
<br>Next weeks goal<br>---------------------------------------------------------------------------------------------------------------------------------------------------------<br>Write tutorial for testing using random data, work on documentation etc. Keep doing some tests. Discuss about packaging the algorithm with pgRouting library. <br>
<br>[1]<a href="https://github.com/pgRouting/pgrouting/tree/gsoc-tdsp">https://github.com/pgRouting/pgrouting/tree/gsoc-tdsp</a><br>[2]<a href="https://github.com/pgRouting/pgrouting/wiki/APSP">https://github.com/pgRouting/pgrouting/wiki/APSP</a><br>
[3]<a href="https://github.com/pgRouting/pgrouting/blob/gsoc-tdsp/extra/tdsp/sql/data_generate_tdsp.sql">https://github.com/pgRouting/pgrouting/blob/gsoc-tdsp/extra/tdsp/sql/data_generate_tdsp.sql</a><br><div class="gmail_quote">
On Fri, Aug 5, 2011 at 10:58 AM, Jay Mahadeokar <span dir="ltr"><<a href="mailto:jai.mahadeokar@gmail.com">jai.mahadeokar@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
Hi,<br><br>Weekly Report #10<br>Date - 5th Aug 2011<br><br>Current Progress.<br>-------------------------------------------------------------------------------------------------------------------------------------------------------<br>
After much brain-storming in the community, we decided that the proposed cyclic data optimization was a little bit premature, and we would just focus on completion of the basic algorithm as proposed in the GSoc proposal during the GSoc timeline. <br>
<br>So, the major function will be pgr_time_dependent_shortest_path.<br>For cyclic data, we will have function like: pgr_tdsp_cyclic. The weight_map class has been modified for that, but the default constructor keeps the behaviour non-cyclic for now. We will keep brainstorming until the requirements and idea of cyclic data are properly identified and defined and then provide support for the optimization.<br>
<br>In the mean time I also cleaned up the code and continued testing.<br><br>Next week goals.<br>------------------------------------------------------------------------------------------------------------------------------------------------------<br>
Try and finish up the documentation work needed for tdsp. Including examples to convert some common data formats to tdsp and potential plsql scripts for the same. <br><br>Since the major portion of GSoc proposal is completed,I also plan to work on all-pairs shortest path implementation for pgRouting(not part of the GSoc proposal, I had worked on it earlier), and I will try and finish it up and document it within GSoc timeline as planned earlier with my mentor if time permits.<div>
<div></div><div class="h5"><br>
<br><br><br clear="all"><br></div></div>-- <br>Regards,<br><font color="#888888">-Jay Mahadeokar<br><br>
</font></blockquote></div><br><br clear="all"><br>-- <br>Regards,<br>-Jay Mahadeokar<br><br>