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
D Tomlinson
reaches
Roger Federer
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 1 meeting01March 29, 1971View D Tomlinson × Roy Schwegman →02 BridgeOpen career →Roy Schwegman
1 meeting01March 29, 1971View Roy Schwegman × Dennis Matthews →03— BridgeOpen career →Dennis Matthews
1 meeting01April 8, 1972View Dennis Matthews × Jaime Fillol →04 BridgeOpen career →Jaime Fillol
1 meeting10July 21, 1980View Jaime Fillol × Jimmy Arias →05 BridgeOpen career →Jimmy Arias
1 meeting01February 10, 1992View Jimmy Arias × Gianluca Pozzi →06 BridgeOpen career →Gianluca Pozzi
2 meetings11April 2, 1999 — February 28, 2000View Gianluca Pozzi × Roger Federer →07 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 6 links. Every route travels the shortest possible distance in the archive.
- OriginD Tomlinson
- BridgeRoy Schwegman
- —BridgeDennis Matthews
- BridgeJaime Fillol
- BridgeJimmy Arias
- BridgeFrancisco Clavet
- DestinationRoger Federer
- OriginD Tomlinson
- BridgeRoy Schwegman
- —BridgeDennis Matthews
- BridgeJaime Fillol
- BridgeJimmy Arias
- BridgeMagnus Larsson
- DestinationRoger Federer
- OriginD Tomlinson
- BridgeRoy Schwegman
- —BridgeDennis Matthews
- BridgeJaime Fillol
- BridgeJimmy Arias
- BridgeRichard Fromberg
- DestinationRoger Federer
- OriginD Tomlinson
- BridgeRoy Schwegman
- —BridgeDennis Matthews
- BridgeJaime Fillol
- BridgeJimmy Arias
- BridgeAndre Agassi
- 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 →