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
Nejc Podkrajsek
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 meeting01July 11, 2003View Nejc Podkrajsek × Mik Ledvonova →02 BridgeOpen career →Mik Ledvonova
1 meeting01July 11, 2003View Mik Ledvonova × Marko Tkalec →03 BridgeOpen career →Marko Tkalec
1 meeting01July 11, 2003View Marko Tkalec × Kenneth Carlsen →04 BridgeOpen career →Kenneth Carlsen
1 meeting10March 15, 1999View Kenneth Carlsen × 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.
- OriginNejc Podkrajsek
- BridgeMik Ledvonova
- BridgeMarko Tkalec
- BridgeAttila Savolt
- DestinationRoger Federer
- OriginNejc Podkrajsek
- BridgeMik Ledvonova
- BridgeMarko Tkalec
- BridgeJarkko Nieminen
- DestinationRoger Federer
- OriginNejc Podkrajsek
- BridgeMik Ledvonova
- BridgeMarko Tkalec
- BridgeRui Machado
- DestinationRoger Federer
- OriginNejc Podkrajsek
- BridgeMik Ledvonova
- BridgeMarko Tkalec
- BridgeMarcos Baghdatis
- 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 →