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
D Tomlinson
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 meeting01July 21, 1980View Jimmy Arias × Jaime Fillol →04 BridgeOpen career →Jaime Fillol
1 meeting10April 8, 1972View Jaime Fillol × Dennis Matthews →05— BridgeOpen career →Dennis Matthews
1 meeting10March 29, 1971View Dennis Matthews × Roy Schwegman →06 BridgeOpen career →Roy Schwegman
1 meeting10March 29, 1971View Roy Schwegman × D Tomlinson →07 DestinationOpen career →D Tomlinson
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
- BridgeVijay Amritraj
- BridgeRobert Maud
- BridgeAshley Hewitt
- BridgeRoy Schwegman
- DestinationD Tomlinson
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeVijay Amritraj
- BridgeAlvin Gardiner
- —BridgeDennis Matthews
- BridgeRoy Schwegman
- DestinationD Tomlinson
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeVijay Amritraj
- BridgeOwen Davidson
- —BridgeDennis Matthews
- BridgeRoy Schwegman
- DestinationD Tomlinson
- OriginRoger Federer
- BridgeFrancisco Clavet
- BridgeJimmy Arias
- BridgeJaime Fillol
- —BridgeDennis Matthews
- BridgeRoy Schwegman
- DestinationD Tomlinson
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 →