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 Campbell
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 meeting10March 5, 2025View Carlos Alcaraz × Quentin Halys →02 BridgeOpen career →Quentin Halys
2 meetings11July 24, 2017 — July 30, 2018View Quentin Halys × Gilles Muller →03 BridgeOpen career →Gilles Muller
1 meeting10April 28, 2000View Gilles Muller × Peter Clarke →04 BridgeOpen career →Peter Clarke
1 meeting01May 31, 1971View Peter Clarke × Bob Hewitt →05 BridgeOpen career →Bob Hewitt
2 meetings11August 5, 1968 — July 10, 1972View Bob Hewitt × Gene Scott →06 BridgeOpen career →Gene Scott
1 meeting10December 13, 1972View Gene Scott × Tom Campbell →07 DestinationOpen career →Tom Campbell
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
- BridgeKaren Khachanov
- BridgeGilles Muller
- BridgePeter Clarke
- BridgeBob Hewitt
- BridgeGene Scott
- DestinationTom Campbell
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMiloslav Mecir
- BridgeVijay Amritraj
- BridgeGene Scott
- DestinationTom Campbell
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeMiloslav Mecir
- BridgeVitas Gerulaitis
- BridgeGene Scott
- DestinationTom Campbell
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Arias
- BridgeJaime Fillol
- BridgeGene Scott
- DestinationTom Campbell
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 →