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
Pavel Sevcik
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 →2 meetings11April 2, 1999 — February 28, 2000View Roger Federer × Gianluca Pozzi →02 BridgeOpen career →Gianluca Pozzi
2 meetings11August 10, 1992 — February 1, 1993View Gianluca Pozzi × Ivan Lendl →03 BridgeOpen career →Ivan Lendl
1 meeting10October 30, 1978View Ivan Lendl × Vladimir Zednik →04 BridgeOpen career →Vladimir Zednik
1 meeting10October 28, 1973View Vladimir Zednik × Pavel Sevcik →05 DestinationOpen career →Pavel Sevcik
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
- BridgeFrancisco Clavet
- BridgeJohn McEnroe
- BridgeVladimir Zednik
- DestinationPavel Sevcik
- OriginRoger Federer
- BridgeFrancisco Clavet
- BridgeAndres Gomez
- BridgeVladimir Zednik
- DestinationPavel Sevcik
- OriginRoger Federer
- BridgeCedric Pioline
- BridgeJimmy Connors
- BridgeVladimir Zednik
- DestinationPavel Sevcik
- OriginRoger Federer
- BridgeCedric Pioline
- BridgeIvan Lendl
- BridgeVladimir Zednik
- DestinationPavel Sevcik
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 →