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
Daniel Llarenas
Historical windowComplete archive
The connection uses 5 links and 6 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 OriginOpen career →7 meetings61August 27, 1990 — August 5, 1996View Pete Sampras × Jakob Hlasek →02 BridgeOpen career →Jakob Hlasek
1 meeting10September 23, 1994View Jakob Hlasek × Suwandi Suwandi →03 BridgeOpen career →Suwandi Suwandi
1 meeting01July 15, 2005View Suwandi Suwandi × Xin Yuan Yu →04 BridgeOpen career →Xin Yuan Yu
1 meeting10February 8, 2008View Xin Yuan Yu × Rami Osman →05 BridgeOpen career →Rami Osman
1 meeting01April 6, 2012View Rami Osman × Daniel Llarenas →06 DestinationOpen career →Daniel Llarenas
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 5 links. Every route travels the shortest possible distance in the archive.
- OriginPete Sampras
- BridgeJeff Tarango
- BridgeSuwandi Suwandi
- BridgeXin Yuan Yu
- BridgeRami Osman
- DestinationDaniel Llarenas
- OriginPete Sampras
- BridgeMarc Rosset
- BridgeSuwandi Suwandi
- BridgeXin Yuan Yu
- BridgeRami Osman
- DestinationDaniel Llarenas
- OriginPete Sampras
- BridgeMauricio Hadad
- BridgeSuwandi Suwandi
- BridgeXin Yuan Yu
- BridgeRami Osman
- DestinationDaniel Llarenas
- OriginPete Sampras
- BridgeGreg Rusedski
- BridgeSuwandi Suwandi
- BridgeXin Yuan Yu
- BridgeRami Osman
- DestinationDaniel Llarenas
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 →