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
Ignacio Parisca
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 meeting01August 12, 2019View Roger Federer × Andrey Rublev →02 BridgeOpen career →Andrey Rublev
1 meeting10August 25, 2025View Andrey Rublev × Coleman Wong →03 BridgeOpen career →Coleman Wong
1 meeting10February 1, 2025View Coleman Wong × Codie Schalk Van Schalkwyk →04Open career → 1 meeting01February 7, 2026View Codie Schalk Van Schalkwyk × Markus Molder →05 BridgeOpen career →Markus Molder
1 meeting10January 31, 2025View Markus Molder × Ignacio Parisca →06 DestinationOpen career →Ignacio Parisca
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.
- OriginRoger Federer
- BridgeMohammad Ghareeb
- BridgeM Abid Ali Khan Akbar
- BridgeHamid Reza Nadaf
- BridgeOliver Ojakaar
- DestinationIgnacio Parisca
- OriginRoger Federer
- BridgeAljaz Bedene
- BridgeKristjan Tamm
- BridgeSina Moghimi
- BridgeOliver Ojakaar
- DestinationIgnacio Parisca
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 →