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
Roger Federer
reaches
Aissa Benchakroun
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 →1 meeting10August 26, 2019View Roger Federer × Sumit Nagal →02 BridgeOpen career →Sumit Nagal
1 meeting01April 6, 2018View Sumit Nagal × Ze Zhang →03 BridgeOpen career →Ze Zhang
1 meeting10March 4, 2016View Ze Zhang × Yasir Khan →04 BridgeOpen career →Yasir Khan
1 meeting01February 14, 2014View Yasir Khan × Linh Giang Trinh →05 BridgeOpen career →Linh Giang Trinh
1 meeting01March 6, 2020View Linh Giang Trinh × Aissa Benchakroun →06 DestinationOpen career →Aissa Benchakroun
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.
- OriginRoger Federer
- BridgeRadek Stepanek
- BridgeZe Zhang
- BridgeYasir Khan
- BridgeLinh Giang Trinh
- DestinationAissa Benchakroun
- OriginRoger Federer
- BridgeYen Hsun Lu
- BridgePatrick Tierro
- BridgeYasir Khan
- BridgeLinh Giang Trinh
- DestinationAissa Benchakroun
- OriginRoger Federer
- BridgeFernando Verdasco
- BridgeAlexandar Lazarov
- BridgePhilip Henning
- BridgeLinh Giang Trinh
- DestinationAissa Benchakroun
- OriginRoger Federer
- BridgeLloyd Harris
- BridgeAlexandar Lazarov
- BridgePhilip Henning
- BridgeLinh Giang Trinh
- DestinationAissa Benchakroun
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 →