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
Will Farah Lebar
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 meeting01April 9, 2004View Will Farah Lebar × Hee Seok Chung →02 BridgeOpen career →Hee Seok Chung
1 meeting01February 7, 2003View Hee Seok Chung × Paradorn Srichaphan →03 BridgeOpen career →Paradorn Srichaphan
4 meetings04September 27, 2004 — October 23, 2006View Paradorn Srichaphan × Roger Federer →04 DestinationOpen career →Roger Federer
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.
- OriginWill Farah Lebar
- BridgeHee Seok Chung
- BridgeRohan Bopanna
- DestinationRoger Federer
- OriginWill Farah Lebar
- BridgeAnoosha Shahgholi
- BridgeMohammad Ghareeb
- 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 →