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
Steffi Graf
reaches
Na Lae Han
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 →3 meetings30May 19, 1997 — June 21, 1999View Steffi Graf × Mirjana Lucic →02 BridgeOpen career →Mirjana Lucic
1 meeting10June 29, 2015View Mirjana Lucic × Yaroslava Shvedova →03 BridgeOpen career →Yaroslava Shvedova
1 meeting10February 3, 2016View Yaroslava Shvedova × Na Lae Han →04 DestinationOpen career →Na Lae Han
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.
- OriginSteffi Graf
- BridgeMirjana Lucic
- BridgeVarvara Lepchenko
- DestinationNa Lae Han
- OriginSteffi Graf
- BridgeMirjana Lucic
- BridgeKristina Mladenovic
- DestinationNa Lae Han
- OriginSteffi Graf
- BridgeMirjana Lucic
- BridgeQiang Wang
- DestinationNa Lae Han
- OriginSteffi Graf
- BridgeMirjana Lucic
- BridgeLuksika Kumkhum
- DestinationNa Lae Han
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 →