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 Beasant
Historical windowComplete archive
The connection uses 5 links and 6 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 meeting10July 28, 1981View Jimmy Arias × Ilie Nastase →04 BridgeOpen career →Ilie Nastase
2 meetings20March 30, 1971 — June 23, 1972View Ilie Nastase × John Clifton →05 BridgeOpen career →John Clifton
1 meeting10June 3, 1974View John Clifton × D Beasant →06— DestinationOpen career →D Beasant
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 5 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeJimmy Arias
- BridgeSyd Ball
- BridgeJohn Clifton
- —DestinationD Beasant
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeMats Wilander
- BridgeStan Smith
- BridgeJohn Clifton
- —DestinationD Beasant
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeGuy Forget
- BridgeAndrew Pattison
- BridgeJohn Clifton
- —DestinationD Beasant
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeVijay Amritraj
- BridgePatricio Rodriguez Chi
- BridgeJohn Clifton
- —DestinationD Beasant
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 →