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
Ivan Cerovic
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 meeting10June 25, 2001View Roger Federer × Pete Sampras →02 BridgeOpen career →Pete Sampras
1 meeting10August 20, 2001View Pete Sampras × Alexander Peya →03 BridgeOpen career →Alexander Peya
1 meeting10February 10, 2006View Alexander Peya × Ivan Cerovic →04 DestinationOpen career →Ivan Cerovic
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.
- OriginRoger Federer
- BridgeDavide Sanguinetti
- BridgeAlexander Peya
- DestinationIvan Cerovic
- OriginRoger Federer
- BridgeFabrice Santoro
- BridgeAlexander Peya
- DestinationIvan Cerovic
- OriginRoger Federer
- BridgeAndrei Pavel
- BridgeAlexander Peya
- DestinationIvan Cerovic
- OriginRoger Federer
- BridgeThomas Enqvist
- BridgeAlexander Peya
- DestinationIvan Cerovic
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 →