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
Taras Beiko
reaches
Roger Federer
Historical windowComplete archive
The connection uses 4 links and 5 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 OriginOpen career →1 meeting10April 29, 1994View Taras Beiko × Stewart Doyle →02 BridgeOpen career →Stewart Doyle
1 meeting01February 1, 1991View Stewart Doyle × Bernardo Mota →03 BridgeOpen career →Bernardo Mota
1 meeting01July 27, 1992View Bernardo Mota × Goran Ivanisevic →04 BridgeOpen career →Goran Ivanisevic
2 meetings02February 21, 2000 — January 29, 2001View Goran Ivanisevic × Roger Federer →05 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 4 links. Every route travels the shortest possible distance in the archive.
- OriginTaras Beiko
- BridgeStewart Doyle
- BridgeBernardo Mota
- BridgeWayne Ferreira
- DestinationRoger Federer
- OriginTaras Beiko
- BridgeStewart Doyle
- BridgeBernardo Mota
- BridgeDavide Sanguinetti
- DestinationRoger Federer
- OriginTaras Beiko
- BridgeStewart Doyle
- BridgeBernardo Mota
- BridgeGreg Rusedski
- DestinationRoger Federer
- OriginTaras Beiko
- BridgeStewart Doyle
- BridgeBernardo Mota
- BridgeHicham Arazi
- 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 →