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
R S Edwards
reaches
Pete Sampras
Historical windowComplete archive
The connection uses 5 links and 6 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 meeting01July 5, 1970View R S Edwards × C J Bendall →02 BridgeOpen career →C J Bendall
1 meeting01July 5, 1970View C J Bendall × Nikola Pilic →03 BridgeOpen career →Nikola Pilic
11 meetings29January 20, 1968 — February 6, 1972View Nikola Pilic × Tony Roche →04 BridgeOpen career →Tony Roche
5 meetings05March 4, 1976 — October 31, 1978View Tony Roche × Jimmy Connors →05 BridgeOpen career →Jimmy Connors
2 meetings02March 13, 1992 — April 27, 1992View Jimmy Connors × Pete Sampras →06 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 5 links. Every route travels the shortest possible distance in the archive.
- OriginR S Edwards
- BridgeC J Bendall
- BridgeNikola Pilic
- BridgeTony Roche
- BridgeJohn McEnroe
- DestinationPete Sampras
- OriginR S Edwards
- BridgeC J Bendall
- BridgeNikola Pilic
- BridgeAllan Stone
- BridgeJimmy Connors
- DestinationPete Sampras
- OriginR S Edwards
- BridgeC J Bendall
- BridgeNikola Pilic
- BridgeAllan Stone
- BridgeEliot Teltscher
- DestinationPete Sampras
- OriginR S Edwards
- BridgeC J Bendall
- BridgeNikola Pilic
- BridgeAllan Stone
- BridgeTim Wilkison
- 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 →