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
Pat Serret
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 meeting01June 7, 1999View Roger Federer × Byron Black →02 BridgeOpen career →Byron Black
1 meeting10April 3, 1987View Byron Black × Nduka Odizor →03 BridgeOpen career →Nduka Odizor
1 meeting01January 5, 1987View Nduka Odizor × Pat Serret →04 DestinationOpen career →Pat Serret
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 3 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeGoran Ivanisevic
- BridgeCarl Limberger
- DestinationPat Serret
- OriginRoger Federer
- BridgeMichael Chang
- BridgeCarl Limberger
- DestinationPat Serret
- OriginRoger Federer
- BridgeMichael Chang
- BridgeNduka Odizor
- DestinationPat Serret
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 →