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
Marina Lidiya
reaches
Coco Gauff
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 →1 meeting01February 2, 2008View Marina Lidiya × Kim Sadi →02 BridgeOpen career →Kim Sadi
1 meeting01February 4, 2010View Kim Sadi × Bermet Duvanaeva →03 BridgeOpen career →Bermet Duvanaeva
1 meeting10February 3, 2012View Bermet Duvanaeva × Ling Zhang →04 BridgeOpen career →Ling Zhang
1 meeting01February 7, 2015View Ling Zhang × Su Wei Hsieh →05 BridgeOpen career →Su Wei Hsieh
1 meeting01August 16, 2021View Su Wei Hsieh × Coco Gauff →06 DestinationOpen career →Coco Gauff
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.
- OriginMarina Lidiya
- BridgeKim Sadi
- BridgeBermet Duvanaeva
- BridgeLing Zhang
- BridgeShuai Zhang
- DestinationCoco Gauff
- OriginMarina Lidiya
- BridgeKim Sadi
- BridgeBermet Duvanaeva
- BridgeLing Zhang
- BridgeZarina Diyas
- DestinationCoco Gauff
- OriginMarina Lidiya
- BridgeKim Sadi
- BridgeBermet Duvanaeva
- BridgeLing Zhang
- BridgeQiang Wang
- DestinationCoco Gauff
- OriginMarina Lidiya
- BridgeKim Sadi
- BridgeBermet Duvanaeva
- BridgeLing Zhang
- BridgeLin Zhu
- DestinationCoco Gauff
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 →