The practical guide to route calculation algorithms

The pioneering algorithm created
to answer a simple question:
The shortest path from a point
x to a point y, in a graph.

The algorithm that can calculate all possible routes between two random points in the London network in just 8 milliseconds.

The Connection Scan Algorithm known to be simpler to understand and implement than its predecessor RAPTOR.

The algorithm used by the web giant Google, considered the fastest with the ability to answer queries in real time.