Origin
Open career →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
Walter Hodsdon
Historical windowComplete archive
The connection uses 6 links and 7 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 2 meetings11April 2, 1999 — February 28, 2000View Roger Federer × Gianluca Pozzi →02 BridgeOpen career →Gianluca Pozzi
1 meeting10February 10, 1992View Gianluca Pozzi × Jimmy Arias →03 BridgeOpen career →Jimmy Arias
1 meeting10November 1, 1982View Jimmy Arias × Fred Stolle →04 BridgeOpen career →Fred Stolle
1 meeting10December 30, 1968View Fred Stolle × Koji Watanabe →05 BridgeOpen career →Koji Watanabe
1 meeting10December 30, 1968View Koji Watanabe × R Campbell →06 BridgeOpen career →R Campbell
1 meeting10December 30, 1968View R Campbell × Walter Hodsdon →07 DestinationOpen career →Walter Hodsdon
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 6 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeGuy Forget
- BridgePhil Dent
- BridgeKoji Watanabe
- BridgeR Campbell
- DestinationWalter Hodsdon
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeVijay Amritraj
- BridgePatricio Rodriguez Chi
- BridgeKoji Watanabe
- BridgeR Campbell
- DestinationWalter Hodsdon
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeVijay Amritraj
- BridgeNikola Pilic
- BridgeKoji Watanabe
- BridgeR Campbell
- DestinationWalter Hodsdon
- OriginRoger Federer
- BridgeFrancisco Clavet
- BridgeJimmy Arias
- BridgeFred Stolle
- BridgeKoji Watanabe
- BridgeR Campbell
- DestinationWalter Hodsdon
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 →