Using CGAL to do a geodesic walk [closed]

With CGAL one can get the shortest path via two points doing a geodesic walk. I have similar problem in that I would like to do a geodesic walk but instead of having an end point I have direction and distance. In looking through the package I did not see a geodesic walk algorithm and wanted to inquire before writing my own.