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
Daniel Montes De Oca
reaches
Roger Federer
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 meeting01August 7, 1989View Daniel Montes De Oca × Chris Bailey →02 BridgeOpen career →Chris Bailey
1 meeting01April 12, 1993View Chris Bailey × Jan Siemerink →03 BridgeOpen career →Jan Siemerink
1 meeting10September 28, 1998View Jan Siemerink × Roger Federer →04 DestinationOpen career →Roger Federer
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.
- OriginDaniel Montes De Oca
- BridgeChris Bailey
- BridgeRichard Fromberg
- DestinationRoger Federer
- OriginDaniel Montes De Oca
- BridgeChris Bailey
- BridgeGoran Ivanisevic
- DestinationRoger Federer
- OriginDaniel Montes De Oca
- BridgeChris Bailey
- BridgeMichael Chang
- DestinationRoger Federer
- OriginDaniel Montes De Oca
- BridgeChris Bailey
- BridgeJonas Bjorkman
- DestinationRoger Federer
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 →