Tennis’s living graph
Bridges Across
Eras
Two players do not need to have shared a court for their stories to be connected. Find the shortest chain of head-to-head meetings between them.
Shortest path found
Andrei Daescu
reaches
Pete Sampras
Historical windowComplete archive
The connection uses 3 links and 4 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 OriginOpen career →1 meeting01April 6, 2012View Andrei Daescu × Robin Haase →02 BridgeOpen career →Robin Haase
1 meeting01April 6, 2007View Robin Haase × Tim Henman →03 BridgeOpen career →Tim Henman
7 meetings16April 4, 1994 — August 7, 2000View Tim Henman × Pete Sampras →04 DestinationOpen career →Pete Sampras
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginAndrei Daescu
- BridgeRobin Haase
- BridgeFelix Mantilla
- DestinationPete Sampras
- OriginAndrei Daescu
- BridgeRobin Haase
- BridgeRainer Schuettler
- DestinationPete Sampras
- OriginAndrei Daescu
- BridgeRobin Haase
- BridgeAgustin Calleri
- DestinationPete Sampras
- OriginAndrei Daescu
- BridgeRobin Haase
- BridgeNicolas Kiefer
- DestinationPete Sampras
How we calculate it
A search from both sides of history.
The portal traverses the head-to-head graph from both careers at the same time and stops at the first proven minimum distance. When a period is selected, only matches inside that window create links; walkovers never create connections.
Reverse the route →