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
Relja Fiser Dulic
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 meeting10September 18, 2000View Roger Federer × Karim Alami →02 BridgeOpen career →Karim Alami
1 meeting10July 15, 1994View Karim Alami × Bartlomiej Dabrowski →03 BridgeOpen career →Bartlomiej Dabrowski
1 meeting10July 20, 2001View Bartlomiej Dabrowski × Relja Fiser Dulic →04 DestinationOpen career →Relja Fiser Dulic
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
- BridgeHicham Arazi
- BridgeBartlomiej Dabrowski
- DestinationRelja Fiser Dulic
- OriginRoger Federer
- BridgeKarol Kucera
- BridgeBartlomiej Dabrowski
- DestinationRelja Fiser Dulic
- OriginRoger Federer
- BridgeJan Kroslak
- BridgeBartlomiej Dabrowski
- DestinationRelja Fiser Dulic
- OriginRoger Federer
- BridgeMax Mirnyi
- BridgeBartlomiej Dabrowski
- DestinationRelja Fiser Dulic
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 →