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
Rihards Emulins
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 meeting10January 17, 2000View Roger Federer × Jan Kroslak →02 BridgeOpen career →Jan Kroslak
1 meeting01May 21, 2001View Jan Kroslak × Ivaylo Traykov →03 BridgeOpen career →Ivaylo Traykov
1 meeting10April 6, 2007View Ivaylo Traykov × Rihards Emulins →04 DestinationOpen career →Rihards Emulins
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 3 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeIvan Ljubicic
- BridgeIvaylo Traykov
- DestinationRihards Emulins
- OriginRoger Federer
- BridgeFilippo Volandri
- BridgeIvaylo Traykov
- DestinationRihards Emulins
- OriginRoger Federer
- BridgeErnests Gulbis
- BridgeIvaylo Traykov
- DestinationRihards Emulins
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 →