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
Abdul Hamid Makhkamov
Historical windowComplete archive
The connection uses 3 links and 4 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 meeting01August 7, 2000View Roger Federer × Francisco Clavet →02 BridgeOpen career →Francisco Clavet
1 meeting10September 8, 1997View Francisco Clavet × Eyal Erlich →03 BridgeOpen career →Eyal Erlich
1 meeting10September 8, 1997View Eyal Erlich × Abdul Hamid Makhkamov →04 DestinationOpen career →Abdul Hamid Makhkamov
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeMichael Chang
- BridgeEyal Erlich
- DestinationAbdul Hamid Makhkamov
- OriginRoger Federer
- BridgeKarim Alami
- BridgeEyal Erlich
- DestinationAbdul Hamid Makhkamov
- OriginRoger Federer
- BridgeKarol Kucera
- BridgeEyal Erlich
- DestinationAbdul Hamid Makhkamov
- OriginRoger Federer
- BridgeAndrei Medvedev
- BridgeEyal Erlich
- DestinationAbdul Hamid Makhkamov
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 →