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
Tom James
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
3 meetings30September 21, 1987 — August 29, 1994View Andre Agassi × Guy Forget →04 BridgeOpen career →Guy Forget
1 meeting10November 8, 1982View Guy Forget × Andrew Pattison →05 BridgeOpen career →Andrew Pattison
1 meeting10September 18, 1978View Andrew Pattison × Joe Bouquin →06 BridgeOpen career →Joe Bouquin
1 meeting10April 6, 1970View Joe Bouquin × Tom James →07 DestinationOpen career →Tom James
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 Connors
- BridgeJan Kodes
- BridgeLuis Augusto Garcia
- DestinationTom James
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Connors
- BridgeCliff Richey
- BridgeAlcides Procopio Jr
- DestinationTom James
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Connors
- BridgeOnny Parun
- BridgeAlcides Procopio Jr
- DestinationTom James
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Connors
- BridgeSteve Faulk
- BridgeLuis Augusto Garcia
- DestinationTom James
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 →