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
L Carter
reaches
Serena Williams
Historical windowComplete archive
The connection uses 6 links and 7 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 meeting01July 17, 1978View L Carter × S Matthews →02 BridgeOpen career →S Matthews
1 meeting01July 17, 1978View S Matthews × Judy Rich →03 BridgeOpen career →Judy Rich
3 meetings03July 17, 1978 — July 16, 1979View Judy Rich × Corinne Molesworth →04 BridgeOpen career →Corinne Molesworth
1 meeting01June 17, 1974View Corinne Molesworth × Dianne Fromholtz →05 BridgeOpen career →Dianne Fromholtz
1 meeting01July 3, 1983View Dianne Fromholtz × Steffi Graf →06 BridgeOpen career →Steffi Graf
2 meetings11January 11, 1999 — March 5, 1999View Steffi Graf × Serena Williams →07 DestinationOpen career →Serena Williams
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 6 links. Every route travels the shortest possible distance in the archive.
- OriginL Carter
- BridgeS Matthews
- BridgeJudy Rich
- BridgeCorinne Molesworth
- BridgeDianne Fromholtz
- BridgeLarisa Savchenko
- DestinationSerena Williams
- OriginL Carter
- BridgeS Matthews
- BridgeJudy Rich
- BridgeCorinne Molesworth
- BridgeDianne Fromholtz
- BridgeMary Joe Fernandez
- DestinationSerena Williams
- OriginL Carter
- BridgeS Matthews
- BridgeJudy Rich
- BridgeCorinne Molesworth
- BridgeSharon Walsh Pete
- BridgeLarisa Savchenko
- DestinationSerena Williams
- OriginL Carter
- BridgeS Matthews
- BridgeJudy Rich
- BridgeCorinne Molesworth
- BridgeSharon Walsh Pete
- BridgeJana Novotna
- DestinationSerena Williams
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 →