Route guidesRoutes Map
Mobile appApp Log in
Write a new posting

Latest journeys

Idea by Sierra van der Meer
Eads to Hugo CO by Gary Nesbit
Pueblo to Eads CO by Gary Nesbit
Johnsonville to Wgtn CBD by Sean Linton
Colorado Springs Parker2 by Gary Nesbit
1 by Agustín Elías Buero
musch test 1 by Spencer Coudal
BS14-Belgrade by Peter Glatzel
malagaseville by Geoffrey Bright
Day 6 - Mablethorpe to Scotton Short by Phil Aitken

Become a supporter

Question about the algorithm behind the 'suggest a ride' feature

Hello,

I use the 'Suggest a ride' feature quite often because I find that it works incredibly well! As a software developer, I can't help but be very curious about how the algorithm works behind the scenes.

I assume there is an internal graph representation of the roads/pathways, but I'm not sure what graph algorithms would be most useful from there. How are circuits found in the graph that are roughly around the target length and seem to be more or less circular so you don't end up going up and down the same road too much? It's so quick at calculating too!

Mark

Page 1
Enter to search, Esc to cancel