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
Pavel Brechja
reaches
Pete Sampras
Historical windowComplete archive
The connection uses 4 links and 5 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 meeting01May 19, 1969View Pavel Brechja × Premjit Lall →02 BridgeOpen career →Premjit Lall
1 meeting01August 12, 1968View Premjit Lall × Mike Belkin →03 BridgeOpen career →Mike Belkin
1 meeting10July 24, 1971View Mike Belkin × Jimmy Connors →04 BridgeOpen career →Jimmy Connors
2 meetings02March 13, 1992 — April 27, 1992View Jimmy Connors × Pete Sampras →05 DestinationOpen career →Pete Sampras
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 4 links. Every route travels the shortest possible distance in the archive.
- OriginPavel Brechja
- BridgePremjit Lall
- BridgeGraham Stilwell
- BridgeJimmy Connors
- DestinationPete Sampras
- OriginPavel Brechja
- BridgePremjit Lall
- BridgeTeimuraz Kakulia
- BridgeJimmy Connors
- DestinationPete Sampras
- OriginPavel Brechja
- BridgePremjit Lall
- BridgeJan Kodes
- BridgeJimmy Connors
- DestinationPete Sampras
- OriginPavel Brechja
- BridgePremjit Lall
- BridgeJan Kodes
- BridgeBill Scanlon
- DestinationPete Sampras
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 →