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
Ismar Gorcic
reaches
Roger Federer
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 meeting10March 5, 2010View Ismar Gorcic × Lazar Magdincev →02 BridgeOpen career →Lazar Magdincev
1 meeting01September 22, 2006View Lazar Magdincev × Jarkko Nieminen →03 BridgeOpen career →Jarkko Nieminen
15 meetings015September 30, 2002 — April 27, 2015View Jarkko Nieminen × Roger Federer →04 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 3 links. Every route travels the shortest possible distance in the archive.
- OriginIsmar Gorcic
- BridgeLazar Magdincev
- BridgeGilles Muller
- DestinationRoger Federer
- OriginIsmar Gorcic
- BridgeLazar Magdincev
- BridgeRobin Haase
- DestinationRoger Federer
- OriginIsmar Gorcic
- BridgeLazar Magdincev
- BridgeLukas Lacko
- DestinationRoger Federer
- OriginIsmar Gorcic
- BridgeLazar Magdincev
- BridgeErnests Gulbis
- 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 →