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
Aldin Setkic
Historical windowComplete archive
The connection uses 2 links and 3 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 meeting10July 15, 2013View Roger Federer × Jan Hajek →02 BridgeOpen career →Jan Hajek
1 meeting10July 28, 2013View Jan Hajek × Aldin Setkic →03 DestinationOpen career →Aldin Setkic
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 3 more sequences with the same 2 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeFernando Verdasco
- DestinationAldin Setkic
- OriginRoger Federer
- BridgeRui Machado
- DestinationAldin Setkic
- OriginRoger Federer
- BridgeFrederico Gil
- DestinationAldin Setkic
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 →