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
Carlos Alcaraz
reaches
Bedri Baykam
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 meeting10April 5, 2021View Carlos Alcaraz × Feliciano Lopez →02 BridgeOpen career →Feliciano Lopez
3 meetings12October 14, 2002 — May 9, 2005View Feliciano Lopez × Andre Agassi →03 BridgeOpen career →Andre Agassi
2 meetings20August 29, 1988 — August 28, 1989View Andre Agassi × Jimmy Connors →04 BridgeOpen career →Jimmy Connors
3 meetings21March 1, 1971 — April 14, 1975View Jimmy Connors × Thomaz Koch →05 BridgeOpen career →Thomaz Koch
1 meeting10July 20, 1975View Thomaz Koch × Yildirak Das →06 BridgeOpen career →Yildirak Das
1 meeting10July 20, 1975View Yildirak Das × Bedri Baykam →07 DestinationOpen career →Bedri Baykam
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.
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeKevin Curren
- BridgeThomaz Koch
- BridgeYildirak Das
- DestinationBedri Baykam
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJohn Fitzgerald
- BridgeThomaz Koch
- BridgeYildirak Das
- DestinationBedri Baykam
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeTodd Martin
- BridgeJimmy Connors
- BridgeThomaz Koch
- BridgeYildirak Das
- DestinationBedri Baykam
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeYounes El Aynaoui
- BridgeCassio Motta
- BridgeThomaz Koch
- BridgeYildirak Das
- DestinationBedri Baykam
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 →