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
Sergej Skakun
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
3 meetings30August 5, 1991 — August 10, 1992View Gianluca Pozzi × Jakob Hlasek →03 BridgeOpen career →Jakob Hlasek
1 meeting10November 4, 1991View Jakob Hlasek × Rudiger Haas →04 BridgeOpen career →Rudiger Haas
1 meeting10November 4, 1991View Rudiger Haas × Sergej Skakun →05 DestinationOpen career →Sergej Skakun
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
- BridgeJakob Hlasek
- BridgeRudiger Haas
- DestinationSergej Skakun
- OriginRoger Federer
- BridgeFrancisco Clavet
- BridgeOmar Camporese
- BridgeRudiger Haas
- DestinationSergej Skakun
- OriginRoger Federer
- BridgeCedric Pioline
- BridgeJakob Hlasek
- BridgeRudiger Haas
- DestinationSergej Skakun
- OriginRoger Federer
- BridgeCedric Pioline
- BridgeOmar Camporese
- BridgeRudiger Haas
- DestinationSergej Skakun
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 →