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
Diego Hidalgo
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 26, 2005View Roger Federer × Marcos Daniel →02 BridgeOpen career →Marcos Daniel
1 meeting10April 11, 2008View Marcos Daniel × Juan Sebastian Cabal →03 BridgeOpen career →Juan Sebastian Cabal
1 meeting10February 10, 2012View Juan Sebastian Cabal × Diego Hidalgo →04 DestinationOpen career →Diego Hidalgo
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
- BridgeSam Groth
- BridgeJuan Sebastian Cabal
- DestinationDiego Hidalgo
- OriginRoger Federer
- BridgeThomaz Bellucci
- BridgeJuan Sebastian Cabal
- DestinationDiego Hidalgo
- OriginRoger Federer
- BridgeBenoit Paire
- BridgeJuan Sebastian Cabal
- DestinationDiego Hidalgo
- OriginRoger Federer
- BridgeMilos Raonic
- BridgeJuan Sebastian Cabal
- DestinationDiego Hidalgo
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 →