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
Jalil Khan
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 meeting01September 28, 1998View Roger Federer × Jan Siemerink →02 BridgeOpen career →Jan Siemerink
1 meeting10February 12, 2001View Jan Siemerink × Cecil Mamiit →03 BridgeOpen career →Cecil Mamiit
2 meetings20February 9, 2007 — July 10, 2009View Cecil Mamiit × Jalil Khan →04 DestinationOpen career →Jalil Khan
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.
- OriginRoger Federer
- BridgeAndre Agassi
- BridgeCecil Mamiit
- DestinationJalil Khan
- OriginRoger Federer
- BridgeTodd Martin
- BridgeCecil Mamiit
- DestinationJalil Khan
- OriginRoger Federer
- BridgeDaniel Vacek
- BridgeCecil Mamiit
- DestinationJalil Khan
- OriginRoger Federer
- BridgeGoran Ivanisevic
- BridgeCecil Mamiit
- DestinationJalil Khan
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 →