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
Brandon Burke
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 →7 meetings70February 1, 1999 — May 14, 2007View Roger Federer × Carlos Moya →02 BridgeOpen career →Carlos Moya
1 meeting10February 26, 2007View Carlos Moya × Bruno Echagaray →03 BridgeOpen career →Bruno Echagaray
1 meeting10March 6, 2009View Bruno Echagaray × Brandon Burke →04 DestinationOpen career →Brandon Burke
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
- BridgeGaston Gaudio
- BridgeBruno Echagaray
- DestinationBrandon Burke
- OriginRoger Federer
- BridgeAlbert Montanes
- BridgeBruno Echagaray
- DestinationBrandon Burke
- OriginRoger Federer
- BridgeMardy Fish
- BridgeBruno Echagaray
- DestinationBrandon Burke
- OriginRoger Federer
- BridgePeter Polansky
- BridgeBruno Echagaray
- DestinationBrandon Burke
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 →