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
Serge Dakessian
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 meeting10February 27, 2006View Roger Federer × Mohammad Ghareeb →02 BridgeOpen career →Mohammad Ghareeb
1 meeting10February 6, 2004View Mohammad Ghareeb × Michael Brown B395 →03 BridgeOpen career →Michael Brown B395
1 meeting10April 6, 2001View Michael Brown B395 × Serge Dakessian →04 DestinationOpen career →Serge Dakessian
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 1 more sequence with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeJimmy Wang
- BridgeMichael Brown B395
- DestinationSerge Dakessian
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 →