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
Pavel Katliarov
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 meeting01July 18, 2008View Pavel Katliarov × Michal Przysiezny →02 BridgeOpen career →Michal Przysiezny
1 meeting01July 9, 2007View Michal Przysiezny × Jonas Bjorkman →03 BridgeOpen career →Jonas Bjorkman
5 meetings05June 25, 2001 — January 15, 2007View Jonas Bjorkman × 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.
- OriginPavel Katliarov
- BridgeMichal Przysiezny
- BridgeNicolas Lapentti
- DestinationRoger Federer
- OriginPavel Katliarov
- BridgeMichal Przysiezny
- BridgeVladimir Voltchkov
- DestinationRoger Federer
- OriginPavel Katliarov
- BridgeMichal Przysiezny
- BridgeDavid Sanchez
- DestinationRoger Federer
- OriginPavel Katliarov
- BridgeMichal Przysiezny
- BridgeJiri Vanek
- 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 →