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
Evgeni Mikheev
reaches
Carlos Alcaraz
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 →1 meeting01April 28, 1995View Evgeni Mikheev × Dimitri Poliakov →02 BridgeOpen career →Dimitri Poliakov
1 meeting01October 7, 1991View Dimitri Poliakov × Goran Ivanisevic →03 BridgeOpen career →Goran Ivanisevic
2 meetings02March 22, 2004 — April 12, 2004View Goran Ivanisevic × Rafael Nadal →04 BridgeOpen career →Rafael Nadal
3 meetings21May 3, 2021 — May 2, 2022View Rafael Nadal × Carlos Alcaraz →05 DestinationOpen career →Carlos Alcaraz
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.
- OriginEvgeni Mikheev
- BridgeDimitri Poliakov
- BridgeWayne Ferreira
- BridgeFeliciano Lopez
- DestinationCarlos Alcaraz
- OriginEvgeni Mikheev
- BridgeDimitri Poliakov
- BridgeFabrice Santoro
- BridgeFeliciano Lopez
- DestinationCarlos Alcaraz
- OriginEvgeni Mikheev
- BridgeDimitri Poliakov
- BridgeFabrice Santoro
- BridgeRafael Nadal
- DestinationCarlos Alcaraz
- OriginEvgeni Mikheev
- BridgeDimitri Poliakov
- BridgeFabrice Santoro
- BridgeRichard Gasquet
- DestinationCarlos Alcaraz
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 →