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
Eyad Shahadeh
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 OriginOpen career →1 meeting01February 3, 1989View Eyad Shahadeh × Khaled Ashkanani →02 BridgeOpen career →Khaled Ashkanani
1 meeting10February 2, 1990View Khaled Ashkanani × Samer Mourad →03 BridgeOpen career →Samer Mourad
1 meeting01May 3, 1991View Samer Mourad × Umesha Wallooppillai →04 BridgeOpen career →Umesha Wallooppillai
2 meetings20February 5, 1988 — February 3, 1989View Umesha Wallooppillai × Selvam Veerasingam →05 BridgeOpen career →Selvam Veerasingam
1 meeting01April 6, 2001View Selvam Veerasingam × Yen Hsun Lu →06 BridgeOpen career →Yen Hsun Lu
3 meetings03June 22, 2009 — January 19, 2015View Yen Hsun Lu × 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.
- OriginEyad Shahadeh
- BridgeKhaled Ashkanani
- BridgeSamer Mourad
- BridgeUmesha Wallooppillai
- BridgeMichael Walker
- BridgeMartin Damm Sr
- DestinationRoger Federer
- OriginEyad Shahadeh
- BridgeKhaled Ashkanani
- BridgeSamer Mourad
- BridgeArjun Fernando
- BridgeSelvam Veerasingam
- BridgeYen Hsun Lu
- DestinationRoger Federer
- OriginEyad Shahadeh
- BridgeKhaled Ashkanani
- BridgeSamer Mourad
- BridgeArjun Fernando
- BridgeVijay Amritraj
- BridgeGianluca Pozzi
- DestinationRoger Federer
- OriginEyad Shahadeh
- BridgeKhaled Ashkanani
- BridgeSamer Mourad
- BridgeArjun Fernando
- BridgeMichael Walker
- BridgeMartin Damm Sr
- 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 →