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
Jae Min Seol
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 OriginOpen career →2 meetings20January 15, 2018 — March 5, 2018View Roger Federer × Hyeon Chung →02 BridgeOpen career →Hyeon Chung
1 meeting10September 28, 2015View Hyeon Chung × Di Wu →03 BridgeOpen career →Di Wu
1 meeting10April 5, 2013View Di Wu × Liang Chi Huang →04 BridgeOpen career →Liang Chi Huang
1 meeting10February 10, 2012View Liang Chi Huang × Jae Min Seol →05 DestinationOpen career →Jae Min Seol
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.
- OriginRoger Federer
- BridgeKaren Khachanov
- BridgeDi Wu
- BridgeLiang Chi Huang
- DestinationJae Min Seol
- OriginRoger Federer
- BridgeCameron Norrie
- BridgeDi Wu
- BridgeLiang Chi Huang
- DestinationJae Min Seol
- OriginRoger Federer
- BridgeTaylor Fritz
- BridgeDi Wu
- BridgeLiang Chi Huang
- DestinationJae Min Seol
- OriginRoger Federer
- BridgeTakao Suzuki
- BridgeDi Wu
- BridgeLiang Chi Huang
- DestinationJae Min Seol
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 →