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
Ignacio Parisca
reaches
Roger Federer
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 →1 meeting01January 31, 2025View Ignacio Parisca × Oliver Ojakaar →02 BridgeOpen career →Oliver Ojakaar
1 meeting10March 15, 2024View Oliver Ojakaar × Sina Moghimi →03 BridgeOpen career →Sina Moghimi
1 meeting10March 15, 2024View Sina Moghimi × Kristjan Tamm →04 BridgeOpen career →Kristjan Tamm
1 meeting01September 16, 2022View Kristjan Tamm × Aljaz Bedene →05 BridgeOpen career →Aljaz Bedene
2 meetings02January 15, 2018 — June 18, 2018View Aljaz Bedene × Roger Federer →06 DestinationOpen career →Roger Federer
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 2 more sequences with the same 5 links. Every route travels the shortest possible distance in the archive.
- OriginIgnacio Parisca
- BridgeOliver Ojakaar
- BridgeHamid Reza Nadaf
- BridgeM Abid Ali Khan Akbar
- BridgeMohammad Ghareeb
- DestinationRoger Federer
- OriginIgnacio Parisca
- BridgeMarkus Molder
- BridgeColeman Wong
- BridgeAndrey Rublev
- 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 →