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
Dmitrii Baskov
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 →10 meetings91June 6, 1994 — June 26, 2000View Pete Sampras × Jonas Bjorkman →02 BridgeOpen career →Jonas Bjorkman
1 meeting10July 9, 2007View Jonas Bjorkman × Michal Przysiezny →03 BridgeOpen career →Michal Przysiezny
1 meeting01April 7, 2018View Michal Przysiezny × Benjamin Lock →04 BridgeOpen career →Benjamin Lock
1 meeting10July 17, 2015View Benjamin Lock × Dmitrii Baskov →05 DestinationOpen career →Dmitrii Baskov
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.
- OriginPete Sampras
- BridgeNicolas Lapentti
- BridgeMichal Przysiezny
- BridgeBenjamin Lock
- DestinationDmitrii Baskov
- OriginPete Sampras
- BridgeAgustin Calleri
- BridgeMichal Przysiezny
- BridgeBenjamin Lock
- DestinationDmitrii Baskov
- OriginPete Sampras
- BridgeVladimir Voltchkov
- BridgeMichal Przysiezny
- BridgeBenjamin Lock
- DestinationDmitrii Baskov
- OriginPete Sampras
- BridgeJiri Vanek
- BridgeMichal Przysiezny
- BridgeBenjamin Lock
- DestinationDmitrii Baskov
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 →