[SoC] GSoC 2023 Introduction: Abhinav Jain - GSoC 2023 Implement pgr_withPointsKSP and Add Overloads

[Abhinav Jain]

Hello Community Members,
I am Abhinav Jain, a master's student from the Indian Institute of
Technology Bombay. Here are my Github[1] and Linkedin[2] profiles.

I will be working on the project "Implement pgr_withPointsKSP and Add
Overloads"[3]. The project aims to Implement pgr_withPointsKSP and all its
overloads. Yen's algorithm computes single-source K-shortest loopless paths
for a graph with non-negative edge cost. It employs any shortest path
algorithm to find the best path, then proceeds to find K − 1 deviations of
the best path. Sometimes the applications work “on the fly,” starting from
a location that is not a vertex in the graph. Those locations, in
pgRouting, are called points of interest. So this function will modify the
graph to include these points of interest and, using Yen’s Algorithm, finds
K shortest paths.

To track the progress of the project during the GSoC period, please check
the wiki page [4].

I would appreciate it if you could look at my timeline for each week and
let me know if there are any mistakes. Any feedback or suggestions you have
would be amazing. I want to make sure I'm on the right track and that my
project is developing well.

Best Regards,
Abhinav Jain

[1] https://github.com/AbhinJ
[2] https://www.linkedin.com/in/abhinj99/
[3]
https://docs.google.com/document/d/14K5eG-zDBQXwTwabHf-gHsdgBsdxkaW7sbdZEVBMOMY/edit?usp=sharing
[4]
https://github.com/pgRouting/pgrouting/wiki/GSoC-2023-Implement-pgr_withPointsKSP-and-Add-Overloads
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/soc/attachments/20230527/1c8a5321/attachment.htm>