Origin
Open career →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
Yannick Mertens
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 1 meeting10February 15, 2010View Yannick Mertens × Jan Hajek →02 BridgeOpen career →Jan Hajek
2 meetings20September 25, 2006 — May 28, 2007View Jan Hajek × Bohdan Ulihrach →03 BridgeOpen career →Bohdan Ulihrach
6 meetings24May 20, 1996 — January 15, 2001View Bohdan Ulihrach × 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.
- OriginYannick Mertens
- BridgeJan Hajek
- BridgeJiri Novak
- DestinationPete Sampras
- OriginYannick Mertens
- BridgeJan Hajek
- BridgeThomas Johansson
- DestinationPete Sampras
- OriginYannick Mertens
- BridgeJan Hajek
- BridgeAgustin Calleri
- DestinationPete Sampras
- OriginYannick Mertens
- BridgeJan Hajek
- BridgeGuillermo Canas
- 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 →