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
Chee Leong Wong
Historical windowComplete archive
The connection uses 6 links and 7 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
1 meeting01August 5, 1991View Gianluca Pozzi × Guy Forget →03 BridgeOpen career →Guy Forget
1 meeting10March 13, 1987View Guy Forget × Jin Sun Yoo →04 BridgeOpen career →Jin Sun Yoo
1 meeting01March 8, 1985View Jin Sun Yoo × Mushaf Zia →05 BridgeOpen career →Mushaf Zia
1 meeting10March 13, 1987View Mushaf Zia × Mahtabur Rahman →06 BridgeOpen career →Mahtabur Rahman
1 meeting10April 7, 1989View Mahtabur Rahman × Chee Leong Wong →07 DestinationOpen career →Chee Leong Wong
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 6 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeAndrei Olhovskiy
- BridgeTanakorn Srichaphan
- BridgeMushaf Zia
- BridgeMahtabur Rahman
- DestinationChee Leong Wong
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeShuzo Matsuoka
- BridgeColin Grant
- BridgeMushaf Zia
- BridgeMahtabur Rahman
- DestinationChee Leong Wong
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeShuzo Matsuoka
- BridgeWorapol Thongkamcho
- BridgeMushaf Zia
- BridgeMahtabur Rahman
- DestinationChee Leong Wong
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeVijay Amritraj
- BridgeArjun Fernando
- BridgeMushaf Zia
- BridgeMahtabur Rahman
- DestinationChee Leong Wong
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 →