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
Luis Alberich
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 OriginOpen career →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 meeting10July 8, 1968View Jaime Fillol × Dan Bleckinger →05 BridgeOpen career →Dan Bleckinger
1 meeting10October 3, 1970View Dan Bleckinger × Jose Maria Gisbert →06 BridgeOpen career →Jose Maria Gisbert
1 meeting10November 11, 1968View Jose Maria Gisbert × Luis Alberich →07 DestinationOpen career →Luis Alberich
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
- BridgeJimmy Arias
- BridgeJaime Fillol
- BridgeHank Irvine
- BridgeJose Maria Gisbert
- DestinationLuis Alberich
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeJimmy Arias
- BridgeSyd Ball
- BridgeHank Irvine
- BridgeJose Maria Gisbert
- DestinationLuis Alberich
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeJimmy Arias
- BridgeJohn James
- BridgeJuan Manuel Couder
- BridgeJose Maria Gisbert
- DestinationLuis Alberich
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeJimmy Arias
- BridgeJohn Alexander
- BridgeHank Irvine
- BridgeJose Maria Gisbert
- DestinationLuis Alberich
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 →