Origin
Open career →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
Pete Sampras
Historical windowComplete archive
The connection uses 6 links and 7 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 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
1 meeting01October 24, 2011View Aljaz Bedene × Tommy Haas →06 BridgeOpen career →Tommy Haas
8 meetings35August 12, 1996 — August 26, 2002View Tommy Haas × Pete Sampras →07 DestinationOpen career →Pete Sampras
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 6 links. Every route travels the shortest possible distance in the archive.
- OriginIgnacio Parisca
- BridgeOliver Ojakaar
- BridgeSina Moghimi
- BridgeKristjan Tamm
- BridgeAljaz Bedene
- BridgeRoger Federer
- DestinationPete Sampras
- OriginIgnacio Parisca
- BridgeOliver Ojakaar
- BridgeSina Moghimi
- BridgeKristjan Tamm
- BridgeAljaz Bedene
- BridgePaul Henri Mathieu
- DestinationPete Sampras
- OriginIgnacio Parisca
- BridgeOliver Ojakaar
- BridgeSina Moghimi
- BridgeKristjan Tamm
- BridgeAljaz Bedene
- BridgeMikhail Youzhny
- DestinationPete Sampras
- OriginIgnacio Parisca
- BridgeOliver Ojakaar
- BridgeHamid Reza Nadaf
- BridgeM Abid Ali Khan Akbar
- BridgeMohammad Ghareeb
- BridgeRoger Federer
- DestinationPete Sampras
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 →