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
Adam Jaya
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 meeting01March 6, 2009View Adam Jaya × G D Jones →02 BridgeOpen career →G D Jones
1 meeting01January 10, 2005View G D Jones × Mariano Zabaleta →03 BridgeOpen career →Mariano Zabaleta
4 meetings13March 20, 2000 — March 21, 2005View Mariano Zabaleta × 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.
- OriginAdam Jaya
- BridgeG D Jones
- BridgeNicolas Massu
- DestinationRoger Federer
- OriginAdam Jaya
- BridgeG D Jones
- BridgeMohammad Ghareeb
- DestinationRoger Federer
- OriginAdam Jaya
- BridgeSuwandi Suwandi
- BridgeMarc Rosset
- DestinationRoger Federer
- OriginAdam Jaya
- BridgeSuwandi Suwandi
- BridgeYounes El Aynaoui
- 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 →