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
Jean Noel Said
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 →5 meetings41October 11, 1999 — April 11, 2005View Roger Federer × Greg Rusedski →02 BridgeOpen career →Greg Rusedski
1 meeting10July 14, 1995View Greg Rusedski × Sebastien Graeff →03 BridgeOpen career →Sebastien Graeff
1 meeting10July 15, 1994View Sebastien Graeff × Jean Noel Said →04 DestinationOpen career →Jean Noel Said
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
- BridgeGreg Rusedski
- BridgeChristophe Boggetti
- DestinationJean Noel Said
- OriginRoger Federer
- BridgeTim Henman
- BridgeSebastien Graeff
- DestinationJean Noel Said
- OriginRoger Federer
- BridgeTim Henman
- BridgeChristophe Boggetti
- DestinationJean Noel Said
- OriginRoger Federer
- BridgeMax Mirnyi
- BridgeValentin Sanon
- DestinationJean Noel Said
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 →