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
Gary Cruth
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
7 meetings52February 24, 1986 — September 22, 1995View Andre Agassi × Mats Wilander →04 BridgeOpen career →Mats Wilander
1 meeting10March 4, 1983View Mats Wilander × Justedjo Tarik →05 BridgeOpen career →Justedjo Tarik
1 meeting10March 26, 1973View Justedjo Tarik × Kenneth Tsui →06 BridgeOpen career →Kenneth Tsui
1 meeting10March 29, 1972View Kenneth Tsui × Gary Cruth →07 DestinationOpen career →Gary Cruth
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
- BridgeJimmy Connors
- BridgeJohn Cooper
- BridgeKenneth Tsui
- DestinationGary Cruth
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Connors
- BridgeJun Kamiwazumi
- BridgeKenneth Tsui
- DestinationGary Cruth
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeRussell Simpson
- BridgeJun Kamiwazumi
- BridgeKenneth Tsui
- DestinationGary Cruth
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeFrancisco Gonzalez
- BridgeJun Kamiwazumi
- BridgeKenneth Tsui
- DestinationGary Cruth
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 →