Origin
Open career →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
Jan Jilemnicky
Historical windowComplete archive
The connection uses 5 links and 6 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 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 meeting10June 13, 1986View Jakob Hlasek × George Kalovelonis →04 BridgeOpen career →George Kalovelonis
1 meeting10May 7, 1982View George Kalovelonis × Bulent Altinkaya →05 BridgeOpen career →Bulent Altinkaya
1 meeting01August 1, 1979View Bulent Altinkaya × Jan Jilemnicky →06 DestinationOpen career →Jan Jilemnicky
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 5 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeFrancisco Clavet
- BridgeJakob Hlasek
- BridgeGeorge Kalovelonis
- BridgeBulent Altinkaya
- DestinationJan Jilemnicky
- OriginRoger Federer
- BridgeCedric Pioline
- BridgeJakob Hlasek
- BridgeGeorge Kalovelonis
- BridgeBulent Altinkaya
- DestinationJan Jilemnicky
- OriginRoger Federer
- BridgeCedric Pioline
- BridgeJimmy Connors
- BridgeRay Ruffels
- BridgeRemzi Aydin
- DestinationJan Jilemnicky
- OriginRoger Federer
- BridgeByron Black
- BridgeJakob Hlasek
- BridgeGeorge Kalovelonis
- BridgeBulent Altinkaya
- DestinationJan Jilemnicky
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 →