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
Ahmed Ramadan
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 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
5 meetings41April 20, 1987 — October 5, 1992View Andre Agassi × Jim Grabb →04 BridgeOpen career →Jim Grabb
1 meeting10July 22, 1985View Jim Grabb × John Lloyd →05 BridgeOpen career →John Lloyd
2 meetings20September 26, 1974 — August 8, 1977View John Lloyd × Ali Madani →06 BridgeOpen career →Ali Madani
1 meeting10August 23, 1974View Ali Madani × Ahmed Ramadan →07 DestinationOpen career →Ahmed Ramadan
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
- BridgeJim Grabb
- BridgeJohn Lloyd
- BridgeAly El Dawoudi
- DestinationAhmed Ramadan
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMiloslav Mecir
- BridgeWojtek Fibak
- BridgeAli Madani
- DestinationAhmed Ramadan
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMiloslav Mecir
- BridgeWojtek Fibak
- BridgeAly El Dawoudi
- DestinationAhmed Ramadan
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMiloslav Mecir
- BridgeBalazs Taroczy
- BridgeAly El Dawoudi
- DestinationAhmed Ramadan
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 →