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
Doug Rees
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
4 meetings22August 4, 1986 — June 22, 1992View Andre Agassi × John McEnroe →04 BridgeOpen career →John McEnroe
1 meeting10August 14, 1978View John McEnroe × Patricio Rodriguez Chi →05 BridgeOpen career →Patricio Rodriguez Chi
1 meeting10March 18, 1968View Patricio Rodriguez Chi × Jorge Berman →06 BridgeOpen career →Jorge Berman
1 meeting10June 4, 1973View Jorge Berman × Doug Rees →07 DestinationOpen career →Doug Rees
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
- BridgeWayne Ferreira
- BridgeBjorn Borg
- BridgePatricio Rodriguez Chi
- BridgeJorge Berman
- DestinationDoug Rees
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeWayne Ferreira
- BridgeJohn McEnroe
- BridgePatricio Rodriguez Chi
- BridgeJorge Berman
- DestinationDoug Rees
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeLionel Roux
- BridgeBjorn Borg
- BridgePatricio Rodriguez Chi
- BridgeJorge Berman
- DestinationDoug Rees
- OriginCarlos Alcaraz
- BridgeRafael Nadal
- BridgeAndre Agassi
- BridgeJohn McEnroe
- BridgePatricio Rodriguez Chi
- BridgeJorge Berman
- DestinationDoug Rees
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 →