Origin
Open career →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 Llarenas
reaches
Roger Federer
Historical windowComplete archive
The connection uses 4 links and 5 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 1 meeting10April 6, 2012View Daniel Llarenas × Rami Osman →02 BridgeOpen career →Rami Osman
1 meeting01February 8, 2008View Rami Osman × Xin Yuan Yu →03 BridgeOpen career →Xin Yuan Yu
1 meeting01September 10, 2007View Xin Yuan Yu × Kevin Kim →04 BridgeOpen career →Kevin Kim
1 meeting01March 25, 2009View Kevin Kim × Roger Federer →05 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 4 links. Every route travels the shortest possible distance in the archive.
- OriginDaniel Llarenas
- BridgeRami Osman
- BridgeXin Yuan Yu
- BridgeYen Hsun Lu
- DestinationRoger Federer
- OriginDaniel Llarenas
- BridgeRami Osman
- BridgeXin Yuan Yu
- BridgeJimmy Wang
- DestinationRoger Federer
- OriginDaniel Llarenas
- BridgeRami Osman
- BridgeXin Yuan Yu
- BridgeTomas Berdych
- DestinationRoger Federer
- OriginDaniel Llarenas
- BridgeRami Osman
- BridgeXin Yuan Yu
- BridgeYuichi Sugita
- 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 →