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
Janos Benyik
Historical windowComplete archive
The connection uses 3 links and 4 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 meetings11February 28, 2000 — June 12, 2000View Roger Federer × Magnus Larsson →02 BridgeOpen career →Magnus Larsson
1 meeting10December 31, 1990View Magnus Larsson × Slobodan Zivojinovic →03 BridgeOpen career →Slobodan Zivojinovic
2 meetings20June 11, 1982 — September 30, 1983View Slobodan Zivojinovic × Janos Benyik →04 DestinationOpen career →Janos Benyik
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeRichard Fromberg
- BridgeSlobodan Zivojinovic
- DestinationJanos Benyik
- OriginRoger Federer
- BridgeAndre Agassi
- BridgeTomas Smid
- DestinationJanos Benyik
- OriginRoger Federer
- BridgeAndre Agassi
- BridgeSlobodan Zivojinovic
- DestinationJanos Benyik
- OriginRoger Federer
- BridgeSergi Bruguera
- BridgeMarko Ostoja
- DestinationJanos Benyik
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 →