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
Hamid Reza Nadaf
Historical windowComplete archive
The connection uses 5 links and 6 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 OriginOpen career →6 meetings51November 13, 2023 — February 16, 2026View Carlos Alcaraz × Andrey Rublev →02 BridgeOpen career →Andrey Rublev
1 meeting10January 4, 2016View Andrey Rublev × Somdev Devvarman →03 BridgeOpen career →Somdev Devvarman
1 meeting10April 5, 2013View Somdev Devvarman × David Agung Susanto →04 BridgeOpen career →David Agung Susanto
1 meeting01July 14, 2015View David Agung Susanto × M Abid Ali Khan Akbar →05 BridgeOpen career →M Abid Ali Khan Akbar
1 meeting01February 3, 2017View M Abid Ali Khan Akbar × Hamid Reza Nadaf →06 DestinationOpen career →Hamid Reza Nadaf
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 5 links. Every route travels the shortest possible distance in the archive.
- OriginCarlos Alcaraz
- BridgeSoon Woo Kwon
- BridgeAisam Ul Haq Qureshi
- BridgeDavid Agung Susanto
- BridgeM Abid Ali Khan Akbar
- DestinationHamid Reza Nadaf
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeDennis Van Scheppingen
- BridgeMohammad Ghareeb
- BridgeM Abid Ali Khan Akbar
- DestinationHamid Reza Nadaf
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeBjorn Phau
- BridgeMohammad Ghareeb
- BridgeM Abid Ali Khan Akbar
- DestinationHamid Reza Nadaf
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeSomdev Devvarman
- BridgeDavid Agung Susanto
- BridgeM Abid Ali Khan Akbar
- DestinationHamid Reza Nadaf
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 →