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
Pete Sampras
reaches
Minoru Ueda
Historical windowComplete archive
The connection uses 3 links and 4 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 OriginOpen career →2 meetings11November 6, 1989 — August 27, 1990View Pete Sampras × Peter Lundgren →02 BridgeOpen career →Peter Lundgren
2 meetings20October 12, 1987 — August 28, 1989View Peter Lundgren × Craig Campbell →03 BridgeOpen career →Craig Campbell
1 meeting10October 14, 1985View Craig Campbell × Minoru Ueda →04 DestinationOpen career →Minoru Ueda
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginPete Sampras
- BridgeBryan Shelton
- BridgeCraig Campbell
- DestinationMinoru Ueda
- OriginPete Sampras
- BridgeDavid Wheaton
- BridgeCraig Campbell
- DestinationMinoru Ueda
- OriginPete Sampras
- BridgeJimmy Connors
- BridgeDrew Gitlin
- DestinationMinoru Ueda
- OriginPete Sampras
- BridgeJohn McEnroe
- BridgeDrew Gitlin
- DestinationMinoru Ueda
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 →