[SoC] GSoC 2019 - Implement Edward Moore's Algorithm, Breadth First Search and Binary Breadth First Search Algorithms in pgRouting - Week 10 Report
GVS Akhil
gvs.akhil1997 at gmail.com
Sun Aug 4 10:51:58 PDT 2019
Hello everyone,
Here is the tenth-week report for my GSoC project.
Any feedback, comments and suggestions are welcome.
*Week 10 Report*
- What did I complete this week?
- Created C++ file which contains the core algorithm and linked the
file to the pgr_edwardMoore function.
- Added a simple, base version of the target algorithm which is able
to calculate the correct path as well as the cost between two nodes in a
graph containing only edges with a non-negative cost.
- Code lint fixes, quality checks and file reorganization in
preparation for code deployment. (Changes currently not visible in PR)
- Created a pull request [2] and merged it.
- What am I going to achieve for next week?
- In the following week, I aim to have the full implementation of the
target algorithm ready. In the final state, the algorithm will be able to
work on graphs containing edges of any cost value.
- Is there any blocking issue?
- No blocking issues.
Public Repository: [2]
Wiki page with all reports: [3]
*Links*
- [1] https://github.com/pgRouting/GSoC-pgRouting/pull/25
- [2] https://github.com/vicennial/GSoC-pgRouting/tree/pgr_edwardMoore
- [3]
https://github.com/pgRouting/pgrouting/wiki/GSoC-2019-Edward-Moore's-Algorithm,-Breadth-First-Search-and-Binary-Breadth-First-Search
Thank you,
GVS Akhil
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/soc/attachments/20190804/c1f4d3f8/attachment.html>
More information about the SoC
mailing list