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
Pete Sampras
reaches
Pavel Chekhov
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 →10 meetings91June 6, 1994 — June 26, 2000View Pete Sampras × Jonas Bjorkman →02 BridgeOpen career →Jonas Bjorkman
2 meetings20July 18, 2005 — June 26, 2006View Jonas Bjorkman × Lukas Dlouhy →03 BridgeOpen career →Lukas Dlouhy
1 meeting10October 22, 2007View Lukas Dlouhy × Pavel Chekhov →04 DestinationOpen career →Pavel Chekhov
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.
- OriginPete Sampras
- BridgeKenneth Carlsen
- BridgeLukas Dlouhy
- DestinationPavel Chekhov
- OriginPete Sampras
- BridgeThomas Enqvist
- BridgeLukas Dlouhy
- DestinationPavel Chekhov
- OriginPete Sampras
- BridgeJiri Novak
- BridgeLukas Dlouhy
- DestinationPavel Chekhov
- OriginPete Sampras
- BridgeRainer Schuettler
- BridgeLukas Dlouhy
- DestinationPavel Chekhov
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 →