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
Ashkan Shokoofi
Historical windowComplete archive
The connection uses 3 links and 4 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 meeting10June 12, 2006View Roger Federer × Rohan Bopanna →02 BridgeOpen career →Rohan Bopanna
1 meeting01April 6, 2007View Rohan Bopanna × Alexey Kedryuk →03 BridgeOpen career →Alexey Kedryuk
1 meeting10July 15, 2005View Alexey Kedryuk × Ashkan Shokoofi →04 DestinationOpen career →Ashkan Shokoofi
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeRohan Bopanna
- BridgeDmitriy Makeyev
- DestinationAshkan Shokoofi
- OriginRoger Federer
- BridgeMohammad Ghareeb
- BridgeAlexey Kedryuk
- DestinationAshkan Shokoofi
- OriginRoger Federer
- BridgeMohammad Ghareeb
- BridgeHiu Tung Yu
- DestinationAshkan Shokoofi
- OriginRoger Federer
- BridgeMohammad Ghareeb
- BridgeDmitriy Makeyev
- DestinationAshkan Shokoofi
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 →