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
Graeme Foster
reaches
Roger Federer
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 →1 meeting01April 5, 1996View Graeme Foster × Naratorn Srichaphan →02 BridgeOpen career →Naratorn Srichaphan
1 meeting01March 27, 1992View Naratorn Srichaphan × Adam Malik →03 BridgeOpen career →Adam Malik
1 meeting01October 2, 1995View Adam Malik × Richard Krajicek →04 BridgeOpen career →Richard Krajicek
2 meetings02October 9, 2000 — June 17, 2002View Richard Krajicek × Roger Federer →05 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 4 links. Every route travels the shortest possible distance in the archive.
- OriginGraeme Foster
- BridgeNaratorn Srichaphan
- BridgeAdam Malik
- BridgeFabrice Santoro
- DestinationRoger Federer
- OriginGraeme Foster
- BridgeNaratorn Srichaphan
- BridgeJoseph Lizardo
- BridgeTakao Suzuki
- DestinationRoger Federer
- OriginGraeme Foster
- BridgeNaratorn Srichaphan
- BridgeJoseph Lizardo
- BridgeParadorn Srichaphan
- DestinationRoger Federer
- OriginGraeme Foster
- BridgeNaratorn Srichaphan
- BridgeJia Ping Xia
- BridgeMikael Tillstrom
- 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 →