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
Greg Shave
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
2 meetings20August 29, 1988 — August 28, 1989View Andre Agassi × Jimmy Connors →04 BridgeOpen career →Jimmy Connors
2 meetings20August 7, 1972 — October 13, 1980View Jimmy Connors × Rick Fisher →05 BridgeOpen career →Rick Fisher
1 meeting10August 12, 1968View Rick Fisher × Frank Korpas →06 BridgeOpen career →Frank Korpas
1 meeting10August 12, 1968View Frank Korpas × Greg Shave →07 DestinationOpen career →Greg Shave
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
- BridgeRussell Simpson
- BridgeRick Fisher
- BridgeFrank Korpas
- DestinationGreg Shave
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeFrancisco Gonzalez
- BridgeRick Fisher
- BridgeFrank Korpas
- DestinationGreg Shave
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeTomas Smid
- BridgeRick Fisher
- BridgeFrank Korpas
- DestinationGreg Shave
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJohn Austin
- BridgeRick Fisher
- BridgeFrank Korpas
- DestinationGreg Shave
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 →