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
Altaf Hussain
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 OriginOpen career →1 meeting10September 13, 1999View Roger Federer × Cedric Pioline →02 BridgeOpen career →Cedric Pioline
1 meeting01May 15, 1989View Cedric Pioline × Jimmy Connors →03 BridgeOpen career →Jimmy Connors
1 meeting10February 17, 1975View Jimmy Connors × Jun Kuki →04 BridgeOpen career →Jun Kuki
1 meeting10December 8, 1978View Jun Kuki × Meer Mohammed Khan →05 BridgeOpen career →Meer Mohammed Khan
1 meeting10October 1, 1977View Meer Mohammed Khan × Albert Cheah →06 BridgeOpen career →Albert Cheah
1 meeting01October 1, 1977View Albert Cheah × Altaf Hussain →07 DestinationOpen career →Altaf Hussain
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
- BridgeCedric Pioline
- BridgeRamesh Krishnan
- BridgeMoon Il Kim
- BridgeMeer Mohammed Khan
- BridgeAlbert Cheah
- DestinationAltaf Hussain
- OriginRoger Federer
- BridgeByron Black
- BridgeJimmy Connors
- BridgeJun Kuki
- BridgeMeer Mohammed Khan
- BridgeAlbert Cheah
- DestinationAltaf Hussain
- OriginRoger Federer
- BridgeByron Black
- BridgeRamesh Krishnan
- BridgeMoon Il Kim
- BridgeMeer Mohammed Khan
- BridgeAlbert Cheah
- DestinationAltaf Hussain
- OriginRoger Federer
- BridgeRichard Fromberg
- BridgeRamesh Krishnan
- BridgeMoon Il Kim
- BridgeMeer Mohammed Khan
- BridgeAlbert Cheah
- DestinationAltaf Hussain
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 →