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
Skip Taylor
reaches
Carlos Alcaraz
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 meeting01April 5, 1971View Skip Taylor × Herbert Rapp →02 BridgeOpen career →Herbert Rapp
1 meeting01July 28, 1969View Herbert Rapp × Stan Smith →03 BridgeOpen career →Stan Smith
1 meeting01November 2, 1981View Stan Smith × Mats Wilander →04 BridgeOpen career →Mats Wilander
7 meetings25February 24, 1986 — September 22, 1995View Mats Wilander × Andre Agassi →05 BridgeOpen career →Andre Agassi
3 meetings21October 14, 2002 — May 9, 2005View Andre Agassi × Feliciano Lopez →06 BridgeOpen career →Feliciano Lopez
1 meeting01April 5, 2021View Feliciano Lopez × Carlos Alcaraz →07 DestinationOpen career →Carlos Alcaraz
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.
- OriginSkip Taylor
- BridgeHerbert Rapp
- BridgeStan Smith
- BridgeMats Wilander
- BridgeAndre Agassi
- BridgeRafael Nadal
- DestinationCarlos Alcaraz
- OriginSkip Taylor
- BridgeHerbert Rapp
- BridgeStan Smith
- BridgeMats Wilander
- BridgeAndre Agassi
- BridgeRichard Gasquet
- DestinationCarlos Alcaraz
- OriginSkip Taylor
- BridgeHerbert Rapp
- BridgeStan Smith
- BridgeMats Wilander
- BridgeTodd Martin
- BridgeFeliciano Lopez
- DestinationCarlos Alcaraz
- OriginSkip Taylor
- BridgeHerbert Rapp
- BridgeStan Smith
- BridgeMats Wilander
- BridgeYounes El Aynaoui
- BridgeFeliciano Lopez
- DestinationCarlos Alcaraz
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 →