Route GuidesRoutes City GuidesCities Map Log in
Write a new posting

Latest journeys

127km_n8_faversham by peter lusis
Glasgow 2 by sigrid ruyssinck
126km_n8_faversham by peter lusis
Pratomagno 100km by Stefano Mazzantini
Adam 3 new by roberto contador
Kings X to Liverpool St by ydaels
qw by SOli
Agen by Marco Poggi
Neville Chanin Audax by Geoff Powell
Amber by Rhys Briley

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