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
Paul Bailey
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 meeting10January 14, 1983View Paul Bailey × Arjun Perera →02 BridgeOpen career →Arjun Perera
1 meeting01January 13, 1984View Arjun Perera × Ke Qin Ma →03 BridgeOpen career →Ke Qin Ma
1 meeting01July 24, 1987View Ke Qin Ma × Shuzo Matsuoka →04 BridgeOpen career →Shuzo Matsuoka
5 meetings14July 22, 1991 — June 26, 1995View Shuzo Matsuoka × Pete Sampras →05 DestinationOpen career →Pete Sampras
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 3 more sequences with the same 4 links. Every route travels the shortest possible distance in the archive.
- OriginPaul Bailey
- BridgeArjun Perera
- BridgePanomkorn Pladchunil
- BridgeShuzo Matsuoka
- DestinationPete Sampras
- OriginPaul Bailey
- BridgeArjun Perera
- BridgePanomkorn Pladchunil
- BridgeBill Scanlon
- DestinationPete Sampras
- OriginPaul Bailey
- BridgeArjun Perera
- BridgePanomkorn Pladchunil
- BridgeKelly Evernden
- 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 →