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
Dimitri Badra
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 meeting10January 13, 2014View Roger Federer × Blaz Kavcic →02 BridgeOpen career →Blaz Kavcic
2 meetings20April 6, 2012 — September 13, 2013View Blaz Kavcic × Ruan Roelofse →03 BridgeOpen career →Ruan Roelofse
1 meeting10September 18, 2021View Ruan Roelofse × Dimitri Badra →04 DestinationOpen career →Dimitri Badra
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 2 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeJerzy Janowicz
- BridgeRuan Roelofse
- DestinationDimitri Badra
- OriginRoger Federer
- BridgeDamir Dzumhur
- BridgeRuan Roelofse
- DestinationDimitri Badra
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 →