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
Roger Federer
reaches
Dane Sweeny
Historical windowComplete archive
The connection uses 2 links and 3 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 OriginOpen career →14 meetings104January 2, 2006 — May 6, 2019View Roger Federer × Gael Monfils →02 BridgeOpen career →Gael Monfils
1 meeting01January 19, 2026View Gael Monfils × Dane Sweeny →03 DestinationOpen career →Dane Sweeny
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 2 more sequences with the same 2 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeAljaz Bedene
- DestinationDane Sweeny
- OriginRoger Federer
- BridgeGrigor Dimitrov
- DestinationDane Sweeny
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 →