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
Nejc Podkrajsek
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 meeting01March 15, 1999View Roger Federer × Kenneth Carlsen →02 BridgeOpen career →Kenneth Carlsen
1 meeting10July 11, 2003View Kenneth Carlsen × Marko Tkalec →03 BridgeOpen career →Marko Tkalec
1 meeting10July 11, 2003View Marko Tkalec × Mik Ledvonova →04 BridgeOpen career →Mik Ledvonova
1 meeting10July 11, 2003View Mik Ledvonova × Nejc Podkrajsek →05 DestinationOpen career →Nejc Podkrajsek
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.
- OriginRoger Federer
- BridgeKenneth Carlsen
- BridgeAndrei Gorban
- BridgeMik Ledvonova
- DestinationNejc Podkrajsek
- OriginRoger Federer
- BridgeAttila Savolt
- BridgeMarko Tkalec
- BridgeMik Ledvonova
- DestinationNejc Podkrajsek
- OriginRoger Federer
- BridgeJarkko Nieminen
- BridgeMarko Tkalec
- BridgeMik Ledvonova
- DestinationNejc Podkrajsek
- OriginRoger Federer
- BridgeRui Machado
- BridgeMarko Tkalec
- BridgeMik Ledvonova
- DestinationNejc Podkrajsek
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 →