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
Sergej Skakun
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 meeting01November 4, 1991View Sergej Skakun × Rudiger Haas →02 BridgeOpen career →Rudiger Haas
1 meeting01May 1, 1989View Rudiger Haas × Carl Limberger →03 BridgeOpen career →Carl Limberger
2 meetings11April 24, 1989 — May 25, 1992View Carl Limberger × Goran Ivanisevic →04 BridgeOpen career →Goran Ivanisevic
2 meetings02February 21, 2000 — January 29, 2001View Goran Ivanisevic × 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.
- OriginSergej Skakun
- BridgeRudiger Haas
- BridgeCarl Limberger
- BridgeMichael Chang
- DestinationRoger Federer
- OriginSergej Skakun
- BridgeRudiger Haas
- BridgeJakob Hlasek
- BridgeGianluca Pozzi
- DestinationRoger Federer
- OriginSergej Skakun
- BridgeRudiger Haas
- BridgeJakob Hlasek
- BridgeFrancisco Clavet
- DestinationRoger Federer
- OriginSergej Skakun
- BridgeRudiger Haas
- BridgeJakob Hlasek
- BridgeCedric Pioline
- 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 →