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
Tsung Hua Yang
Historical windowComplete archive
The connection uses 2 links and 3 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 meeting10May 24, 2010View Roger Federer × Peter Luczak →02 BridgeOpen career →Peter Luczak
1 meeting10March 5, 2010View Peter Luczak × Tsung Hua Yang →03 DestinationOpen career →Tsung Hua Yang
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 2 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeRohan Bopanna
- DestinationTsung Hua Yang
- OriginRoger Federer
- BridgeLleyton Hewitt
- DestinationTsung Hua Yang
- OriginRoger Federer
- BridgeJurgen Melzer
- DestinationTsung Hua Yang
- OriginRoger Federer
- BridgeJohn Isner
- DestinationTsung Hua Yang
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 →