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
Peter Nagy
reaches
Pete Sampras
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 →1 meeting10March 4, 2016View Peter Nagy × Dudi Sela →02 BridgeOpen career →Dudi Sela
1 meeting10February 8, 2008View Dudi Sela × Jonas Bjorkman →03 BridgeOpen career →Jonas Bjorkman
10 meetings19June 6, 1994 — June 26, 2000View Jonas Bjorkman × Pete Sampras →04 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 3 links. Every route travels the shortest possible distance in the archive.
- OriginPeter Nagy
- BridgeDudi Sela
- BridgeWayne Black
- DestinationPete Sampras
- OriginPeter Nagy
- BridgeDudi Sela
- BridgeVincent Spadea
- DestinationPete Sampras
- OriginPeter Nagy
- BridgeDudi Sela
- BridgeThomas Johansson
- DestinationPete Sampras
- OriginPeter Nagy
- BridgeDudi Sela
- BridgeHyung Taik Lee
- 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 →