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
Faisal Syed Haq
reaches
Roger Federer
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 →1 meeting01January 31, 1992View Faisal Syed Haq × Dishan Herath →02 BridgeOpen career →Dishan Herath
1 meeting01March 27, 1992View Dishan Herath × Michael Walker →03 BridgeOpen career →Michael Walker
1 meeting01April 13, 1992View Michael Walker × Martin Damm Sr →04 BridgeOpen career →Martin Damm Sr
1 meeting01October 4, 1999View Martin Damm Sr × Roger Federer →05 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 4 links. Every route travels the shortest possible distance in the archive.
- OriginFaisal Syed Haq
- BridgeJayendra Wijeyesekera
- BridgeSelvam Veerasingam
- BridgeYen Hsun Lu
- DestinationRoger Federer
- OriginFaisal Syed Haq
- BridgeJayendra Wijeyesekera
- BridgeOleg Ogorodov
- BridgeGuillaume Raoux
- DestinationRoger Federer
- OriginFaisal Syed Haq
- BridgeJayendra Wijeyesekera
- BridgeOleg Ogorodov
- BridgeJan Siemerink
- DestinationRoger Federer
- OriginFaisal Syed Haq
- BridgeJayendra Wijeyesekera
- BridgeOleg Ogorodov
- BridgeRichard Fromberg
- 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 →