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
Billy Yap
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 OriginOpen career →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
1 meeting01March 7, 1988View Andre Agassi × Miloslav Mecir →04 BridgeOpen career →Miloslav Mecir
2 meetings20May 20, 1985 — March 7, 1986View Miloslav Mecir × Vijay Amritraj →05 BridgeOpen career →Vijay Amritraj
1 meeting10April 17, 1970View Vijay Amritraj × Senaka Kumara →06 BridgeOpen career →Senaka Kumara
1 meeting10March 20, 1968View Senaka Kumara × Billy Yap →07 DestinationOpen career →Billy Yap
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
- BridgeJimmy Arias
- BridgeJaime Fillol
- BridgeRamanathan Krishnan
- DestinationBilly Yap
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Arias
- BridgeVijay Amritraj
- BridgeSenaka Kumara
- DestinationBilly Yap
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMats Wilander
- BridgeStan Smith
- BridgeRamanathan Krishnan
- DestinationBilly Yap
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMats Wilander
- BridgeVijay Amritraj
- BridgeSenaka Kumara
- DestinationBilly Yap
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 →