[pgrouting-dev] GSoC 2020 - Introduction - Ashish Kumar - Depth First Search and Sequential Vertex Coloring for pgRouting
ashishkr23438 at gmail.com
Thu May 7 11:10:32 PDT 2020
I introduce myself as Ashish Kumar, a sophomore from IIT (BHU) Varanasi
(Indian Institute of Technology - Banaras Hindu University), India pursuing
a B.Tech. degree majoring in Computer Science and Engineering. I go by the
handle ‘krashish8’ on Github , and ‘ashishkr23438’ on all other online
My project for GSoC 2020 is “Depth First Search and Sequential Vertex
Coloring for pgRouting” . I will be implementing the Boost Graph
Algorithms - Undirected DFS, Depth First Search, and Sequential Vertex
Coloring in pgRouting. Also, if time allows, then I would try to implement
the Boost’s Maximum Adjacency Search algorithm too in pgRouting.
Implementing these algorithms would be beneficial to the pgRouting
community, as mentioned in the detailed proposal . Also, the proposal
further explains the algorithms in detail and their significance. Any
feedback, suggestions, or comments from the community members on the
project idea are welcome so that I can refine my project accordingly.
I will be implementing these algorithms in a GitHub fork  of pgRouting’s
GSoC-pgRouting’s repository  on my custom branch created and will be
regularly updating the weekly reports on the project wiki , which will
show my regular progress.
Lastly, I would like to thank the OSGeo as well as the pgRouting community,
for giving me this opportunity. No doubt, this will be an exciting
experience, since this is my first GSoC participation. Also, I had
contributed to open source in the past, but this would be the biggest open
source project in which I would be actively contributing code.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the pgrouting-dev