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
Davit Babayan
reaches
Roger Federer
Historical windowComplete archive
The connection uses 4 links and 5 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 meeting01April 27, 2001View Davit Babayan × Sergei Cuptov →02 BridgeOpen career →Sergei Cuptov
1 meeting01April 9, 2004View Sergei Cuptov × Miguel Gallardo Valles →03 BridgeOpen career →Miguel Gallardo Valles
1 meeting01February 8, 2002View Miguel Gallardo Valles × Daniel Nestor →04 BridgeOpen career →Daniel Nestor
1 meeting01August 28, 2000View Daniel Nestor × Roger Federer →05 DestinationOpen career →Roger Federer
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 4 links. Every route travels the shortest possible distance in the archive.
- OriginDavit Babayan
- BridgeSergei Cuptov
- BridgeMiguel Gallardo Valles
- BridgeFelix Mantilla
- DestinationRoger Federer
- OriginDavit Babayan
- BridgeSergei Cuptov
- BridgeMiguel Gallardo Valles
- BridgeFrederic Niemeyer
- DestinationRoger Federer
- OriginDavit Babayan
- BridgeSergei Cuptov
- BridgeMiguel Gallardo Valles
- BridgeNicolas Lapentti
- DestinationRoger Federer
- OriginDavit Babayan
- BridgeSergei Cuptov
- BridgeMiguel Gallardo Valles
- BridgeCarlos Moya
- DestinationRoger Federer
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 →