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
Mikal Oliver Statham
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 →4 meetings40September 27, 2004 — October 23, 2006View Roger Federer × Paradorn Srichaphan →02 BridgeOpen career →Paradorn Srichaphan
1 meeting10September 23, 2005View Paradorn Srichaphan × Sunu Wahyu Trijati →03 BridgeOpen career →Sunu Wahyu Trijati
1 meeting01July 10, 2009View Sunu Wahyu Trijati × Mikal Oliver Statham →04 DestinationOpen career →Mikal Oliver Statham
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 3 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeMohammad Ghareeb
- BridgeSunu Wahyu Trijati
- DestinationMikal Oliver Statham
- OriginRoger Federer
- BridgeMohammad Ghareeb
- BridgeJohnny Arcilla
- DestinationMikal Oliver Statham
- OriginRoger Federer
- BridgeAndrey Golubev
- BridgeJohnny Arcilla
- DestinationMikal Oliver Statham
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 →