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
Peter Lamp
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 meeting10August 3, 1987View Andre Agassi × Pat Cash →04 BridgeOpen career →Pat Cash
2 meetings20October 15, 1984 — March 18, 1985View Pat Cash × Kim Warwick →05 BridgeOpen career →Kim Warwick
1 meeting10April 2, 1973View Kim Warwick × Bernard Montrenaud →06 BridgeOpen career →Bernard Montrenaud
1 meeting10May 21, 1971View Bernard Montrenaud × Peter Lamp →07 DestinationOpen career →Peter Lamp
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
- BridgeAllan Stone
- BridgeBernard Montrenaud
- DestinationPeter Lamp
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Connors
- BridgeOnny Parun
- BridgeBernard Montrenaud
- DestinationPeter Lamp
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Connors
- BridgeGerald Battrick
- BridgeBernard Montrenaud
- DestinationPeter Lamp
- OriginCarlos Alcaraz
- BridgeFeliciano Lopez
- BridgeAndre Agassi
- BridgeJimmy Connors
- BridgeZeljko Franulovic
- BridgeBernard Montrenaud
- DestinationPeter Lamp
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 →