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
J Gordon
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 meeting01January 7, 1980View J Gordon × Bill Gilmour →02 BridgeOpen career →Bill Gilmour
1 meeting01January 7, 1980View Bill Gilmour × Peter Feigl →03 BridgeOpen career →Peter Feigl
1 meeting01November 26, 1984View Peter Feigl × Jakob Hlasek →04 BridgeOpen career →Jakob Hlasek
7 meetings16August 27, 1990 — August 5, 1996View Jakob Hlasek × 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.
- OriginJ Gordon
- BridgeBill Gilmour
- BridgePeter Feigl
- BridgeAmos Mansdorf
- DestinationPete Sampras
- OriginJ Gordon
- BridgeBill Gilmour
- BridgePeter Feigl
- BridgeHorst Skoff
- DestinationPete Sampras
- OriginJ Gordon
- BridgeBill Gilmour
- BridgePeter Feigl
- BridgeJimmy Connors
- DestinationPete Sampras
- OriginJ Gordon
- BridgeBill Gilmour
- BridgePeter Feigl
- 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 →