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
Carlos Alcaraz
reaches
Navdeep Singh
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 →6 meetings51November 13, 2023 — February 16, 2026View Carlos Alcaraz × Andrey Rublev →02 BridgeOpen career →Andrey Rublev
1 meeting10May 17, 2015View Andrey Rublev × Jarkko Nieminen →03 BridgeOpen career →Jarkko Nieminen
1 meeting10September 24, 2007View Jarkko Nieminen × Toshihide Matsui →04 BridgeOpen career →Toshihide Matsui
1 meeting10September 24, 2007View Toshihide Matsui × Navdeep Singh →05 DestinationOpen career →Navdeep Singh
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.
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeJarkko Nieminen
- BridgeToshihide Matsui
- DestinationNavdeep Singh
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeGuillermo Coria
- BridgeToshihide Matsui
- DestinationNavdeep Singh
- OriginCarlos Alcaraz
- BridgeRafael Nadal
- BridgeJarkko Nieminen
- BridgeToshihide Matsui
- DestinationNavdeep Singh
- OriginCarlos Alcaraz
- BridgeRafael Nadal
- BridgeGuillermo Coria
- BridgeToshihide Matsui
- DestinationNavdeep Singh
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 →