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
Nemanja Kontic
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 →7 meetings52October 31, 2022 — March 4, 2026View Carlos Alcaraz × Grigor Dimitrov →02 BridgeOpen career →Grigor Dimitrov
1 meeting10March 6, 2009View Grigor Dimitrov × Adam Kellner →03 BridgeOpen career →Adam Kellner
1 meeting01March 4, 2005View Adam Kellner × Guillaume Couillard →04 BridgeOpen career →Guillaume Couillard
1 meeting10March 6, 2009View Guillaume Couillard × Nemanja Kontic →05 DestinationOpen career →Nemanja Kontic
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 1 more sequence with the same 4 links. Every route travels the shortest possible distance in the archive.
- OriginCarlos Alcaraz
- BridgeMarton Fucsovics
- BridgeAndis Juska
- BridgeGuillaume Couillard
- DestinationNemanja Kontic
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 →