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
Isaac Tetteh Quaye
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 OriginOpen career →1 meeting10May 3, 1996View Isaac Tetteh Quaye × Daryl Delicata →02 BridgeOpen career →Daryl Delicata
1 meeting01April 8, 1988View Daryl Delicata × Audun Jensen →03 BridgeOpen career →Audun Jensen
1 meeting01June 10, 1988View Audun Jensen × Peter Wright →04 BridgeOpen career →Peter Wright
1 meeting01July 16, 1993View Peter Wright × Younes El Aynaoui →05 BridgeOpen career →Younes El Aynaoui
5 meetings23October 14, 2002 — August 8, 2005View Younes El Aynaoui × 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.
- OriginIsaac Tetteh Quaye
- BridgeDaryl Delicata
- BridgeAudun Jensen
- BridgePeter Wright
- BridgeYounes El Aynaoui
- BridgeRafael Nadal
- DestinationCarlos Alcaraz
- OriginIsaac Tetteh Quaye
- BridgeDaryl Delicata
- BridgeAudun Jensen
- BridgePeter Wright
- BridgeAndrei Pavel
- BridgeFeliciano Lopez
- DestinationCarlos Alcaraz
- OriginIsaac Tetteh Quaye
- BridgeDaryl Delicata
- BridgeAudun Jensen
- BridgePeter Wright
- BridgeAndrei Pavel
- BridgeRichard Gasquet
- DestinationCarlos Alcaraz
- OriginIsaac Tetteh Quaye
- BridgeDaryl Delicata
- BridgeAudun Jensen
- BridgePeter Wright
- BridgeAndrei Pavel
- BridgeAndy Murray
- 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 →