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
Billy Yap
reaches
Carlos Alcaraz
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 meeting01March 20, 1968View Billy Yap × Senaka Kumara →02 BridgeOpen career →Senaka Kumara
1 meeting01April 17, 1970View Senaka Kumara × Vijay Amritraj →03 BridgeOpen career →Vijay Amritraj
2 meetings02May 20, 1985 — March 7, 1986View Vijay Amritraj × Miloslav Mecir →04 BridgeOpen career →Miloslav Mecir
1 meeting10March 7, 1988View Miloslav Mecir × Andre Agassi →05 BridgeOpen career →Andre Agassi
3 meetings21October 14, 2002 — May 9, 2005View Andre Agassi × Feliciano Lopez →06 BridgeOpen career →Feliciano Lopez
1 meeting01April 5, 2021View Feliciano Lopez × Carlos Alcaraz →07 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 6 links. Every route travels the shortest possible distance in the archive.
- OriginBilly Yap
- BridgeSenaka Kumara
- BridgeVijay Amritraj
- BridgeMiloslav Mecir
- BridgeAndre Agassi
- BridgeRafael Nadal
- DestinationCarlos Alcaraz
- OriginBilly Yap
- BridgeSenaka Kumara
- BridgeVijay Amritraj
- BridgeMiloslav Mecir
- BridgeAndre Agassi
- BridgeRichard Gasquet
- DestinationCarlos Alcaraz
- OriginBilly Yap
- BridgeSenaka Kumara
- BridgeVijay Amritraj
- BridgeMiloslav Mecir
- BridgeGoran Ivanisevic
- BridgeRafael Nadal
- DestinationCarlos Alcaraz
- OriginBilly Yap
- BridgeSenaka Kumara
- BridgeVijay Amritraj
- BridgeMartin Jaite
- BridgeAndre Agassi
- BridgeFeliciano Lopez
- 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 →