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
Jan Hajek
Historical windowComplete archive
The connection uses 2 links and 3 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 OriginOpen career →6 meetings42May 20, 1996 — January 15, 2001View Pete Sampras × Bohdan Ulihrach →02 BridgeOpen career →Bohdan Ulihrach
2 meetings02September 25, 2006 — May 28, 2007View Bohdan Ulihrach × Jan Hajek →03 DestinationOpen career →Jan Hajek
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 2 links. Every route travels the shortest possible distance in the archive.
- OriginPete Sampras
- BridgeJiri Novak
- DestinationJan Hajek
- OriginPete Sampras
- BridgeThomas Johansson
- DestinationJan Hajek
- OriginPete Sampras
- BridgeAgustin Calleri
- DestinationJan Hajek
- OriginPete Sampras
- BridgeGuillermo Canas
- DestinationJan Hajek
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 →