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
Chee Leong Wong
reaches
Roger Federer
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 1 meeting01April 7, 1989View Chee Leong Wong × Mahtabur Rahman →02 BridgeOpen career →Mahtabur Rahman
1 meeting01February 3, 1989View Mahtabur Rahman × Ali Kadhim →03 BridgeOpen career →Ali Kadhim
1 meeting01February 2, 1990View Ali Kadhim × Esam Abdulaal →04 BridgeOpen career →Esam Abdulaal
1 meeting01February 23, 1996View Esam Abdulaal × Oleg Ogorodov →05 BridgeOpen career →Oleg Ogorodov
1 meeting01October 30, 1995View Oleg Ogorodov × Guillaume Raoux →06 BridgeOpen career →Guillaume Raoux
2 meetings02September 28, 1998 — February 15, 1999View Guillaume Raoux × Roger Federer →07 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 6 links. Every route travels the shortest possible distance in the archive.
- OriginChee Leong Wong
- BridgeMahtabur Rahman
- BridgeAli Kadhim
- BridgeEsam Abdulaal
- BridgeOleg Ogorodov
- BridgeJan Siemerink
- DestinationRoger Federer
- OriginChee Leong Wong
- BridgeMahtabur Rahman
- BridgeAli Kadhim
- BridgeEsam Abdulaal
- BridgeOleg Ogorodov
- BridgeRichard Fromberg
- DestinationRoger Federer
- OriginChee Leong Wong
- BridgeMahtabur Rahman
- BridgeAli Kadhim
- BridgeEsam Abdulaal
- BridgeOleg Ogorodov
- BridgeMarc Rosset
- DestinationRoger Federer
- OriginChee Leong Wong
- BridgeMahtabur Rahman
- BridgeAli Kadhim
- BridgeEsam Abdulaal
- BridgeOleg Ogorodov
- BridgeDaniel Vacek
- 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 →