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
Ricky Morea
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 OriginOpen career →1 meeting10November 11, 1968View Ricky Morea × Roberto Graetz →02 BridgeOpen career →Roberto Graetz
1 meeting01December 1, 1971View Roberto Graetz × Tom Gorman →03 BridgeOpen career →Tom Gorman
2 meetings11April 14, 1975 — January 1, 1977View Tom Gorman × Russell Simpson →04 BridgeOpen career →Russell Simpson
1 meeting01April 20, 1987View Russell Simpson × 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.
- OriginRicky Morea
- BridgeRoberto Graetz
- BridgeTom Gorman
- BridgeRussell Simpson
- BridgeAndre Agassi
- BridgeRafael Nadal
- DestinationCarlos Alcaraz
- OriginRicky Morea
- BridgeRoberto Graetz
- BridgeTom Gorman
- BridgeFrancisco Gonzalez
- BridgeAndre Agassi
- BridgeFeliciano Lopez
- DestinationCarlos Alcaraz
- OriginRicky Morea
- BridgeRoberto Graetz
- BridgeTom Gorman
- BridgeFrancisco Gonzalez
- BridgeAndre Agassi
- BridgeRafael Nadal
- DestinationCarlos Alcaraz
- OriginRicky Morea
- BridgeRoberto Graetz
- BridgeTom Gorman
- BridgeBjorn Borg
- BridgeWayne Ferreira
- 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 →