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
Ilya Belyaev
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 meeting01October 18, 2010View Ilya Belyaev × Alexandr Dolgopolov →02 BridgeOpen career →Alexandr Dolgopolov
2 meetings20October 25, 2010 — May 22, 2011View Alexandr Dolgopolov × Rainer Schuettler →03 BridgeOpen career →Rainer Schuettler
2 meetings02August 9, 1999 — March 11, 2002View Rainer Schuettler × 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.
- OriginIlya Belyaev
- BridgeAlexandr Dolgopolov
- BridgeTommy Haas
- DestinationPete Sampras
- OriginIlya Belyaev
- BridgeAlexandr Dolgopolov
- BridgeJuan Ignacio Chela
- DestinationPete Sampras
- OriginIlya Belyaev
- BridgeAlexandr Dolgopolov
- BridgeMichael Llodra
- DestinationPete Sampras
- OriginIlya Belyaev
- BridgeAlexandr Dolgopolov
- BridgeXavier Malisse
- 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 →