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
Samir Saadeldin
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 →5 meetings50June 25, 2001 — January 15, 2007View Roger Federer × Jonas Bjorkman →02 BridgeOpen career →Jonas Bjorkman
1 meeting10June 14, 2004View Jonas Bjorkman × Aisam Ul Haq Qureshi →03 BridgeOpen career →Aisam Ul Haq Qureshi
1 meeting10April 6, 2001View Aisam Ul Haq Qureshi × Samir Saadeldin →04 DestinationOpen career →Samir Saadeldin
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
- BridgeFabrice Santoro
- BridgeAisam Ul Haq Qureshi
- DestinationSamir Saadeldin
- OriginRoger Federer
- BridgeCarlos Moya
- BridgeAisam Ul Haq Qureshi
- DestinationSamir Saadeldin
- OriginRoger Federer
- BridgeParadorn Srichaphan
- BridgeAisam Ul Haq Qureshi
- DestinationSamir Saadeldin
- OriginRoger Federer
- BridgeNicolas Massu
- BridgeAisam Ul Haq Qureshi
- DestinationSamir Saadeldin
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 →