Hi everyone,
I’m Aditya, an IT student interested in the Valhalla - Enhance Pedestrian Routing GSoC project. My background is entirely in C++ Competitive Programming (LeetCode Knight, Codeforces Specialist). I am highly comfortable with standard graph traversals (BFS, DFS, Dijkstra) and writing efficient C++ code under strict time and space complexities.
I am currently building Valhalla from source locally. Given the tight deadline, I wanted to ask the project mentors (Kevin, Nils, or Christian):
-
Are you still accepting new proposals for this project?
-
Which specific C++ files should I study first to understand the pedestrian attribution logic?
Thanks!