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
Miha Gregorc
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 →3 meetings30February 13, 2023 — May 7, 2025View Carlos Alcaraz × Laslo Djere →02 BridgeOpen career →Laslo Djere
1 meeting01February 5, 2018View Laslo Djere × Blaz Kavcic →03 BridgeOpen career →Blaz Kavcic
1 meeting10March 6, 2009View Blaz Kavcic × Karim Maamoun →04 BridgeOpen career →Karim Maamoun
1 meeting10April 28, 2000View Karim Maamoun × Miha Gregorc →05 DestinationOpen career →Miha Gregorc
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
- BridgeKaren Khachanov
- BridgeMarcos Baghdatis
- BridgeKarim Maamoun
- DestinationMiha Gregorc
- OriginCarlos Alcaraz
- BridgeNicolas Jarry
- BridgeSergiy Stakhovsky
- BridgeKarim Maamoun
- DestinationMiha Gregorc
- OriginCarlos Alcaraz
- BridgeReilly Opelka
- BridgeSergiy Stakhovsky
- BridgeKarim Maamoun
- DestinationMiha Gregorc
- OriginCarlos Alcaraz
- BridgeAndrey Rublev
- BridgeMarcos Baghdatis
- BridgeKarim Maamoun
- DestinationMiha Gregorc
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 →