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
Hao Chen Tang
reaches
Coco Gauff
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 →1 meeting01February 9, 2013View Hao Chen Tang × Noppawan Lertcheewakarn →02 BridgeOpen career →Noppawan Lertcheewakarn
1 meeting01February 22, 2010View Noppawan Lertcheewakarn × Magdalena Rybarikova →03 BridgeOpen career →Magdalena Rybarikova
1 meeting01July 1, 2019View Magdalena Rybarikova × Coco Gauff →04 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 3 links. Every route travels the shortest possible distance in the archive.
- OriginHao Chen Tang
- BridgeNigina Abduraimova
- BridgeMagdalena Rybarikova
- DestinationCoco Gauff
- OriginHao Chen Tang
- BridgeNigina Abduraimova
- BridgeStefanie Voegele
- DestinationCoco Gauff
- OriginHao Chen Tang
- BridgeNigina Abduraimova
- BridgePetra Martic
- DestinationCoco Gauff
- OriginHao Chen Tang
- BridgeNigina Abduraimova
- BridgeQiang Wang
- 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 →