Origin
Open career →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
Carlos Alcaraz
reaches
Theo Storck
Historical windowComplete archive
The connection uses 6 links and 7 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 1 meeting10April 5, 2021View Carlos Alcaraz × Feliciano Lopez →02 BridgeOpen career →Feliciano Lopez
3 meetings12October 14, 2002 — May 9, 2005View Feliciano Lopez × Andre Agassi →03 BridgeOpen career →Andre Agassi
1 meeting10July 11, 1988View Andre Agassi × Ricki Osterthun →04 BridgeOpen career →Ricki Osterthun
1 meeting10October 12, 1987View Ricki Osterthun × Marko Ostoja →05 BridgeOpen career →Marko Ostoja
1 meeting10September 14, 1979View Marko Ostoja × Jose Vilela →06 BridgeOpen career →Jose Vilela
1 meeting10August 22, 1975View Jose Vilela × Theo Storck →07 DestinationOpen career →Theo Storck
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 6 links. Every route travels the shortest possible distance in the archive.
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeGoran Prpic
- BridgeMarko Ostoja
- BridgeJose Vilela
- DestinationTheo Storck
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMiloslav Mecir
- BridgeIlie Nastase
- BridgeYehoshua Shalem
- DestinationTheo Storck
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Arias
- BridgeIlie Nastase
- BridgeYehoshua Shalem
- DestinationTheo Storck
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Arias
- BridgeMarko Ostoja
- BridgeJose Vilela
- DestinationTheo Storck
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 →