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
Danilo Pila
reaches
Roger Federer
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 meeting01March 30, 1990View Danilo Pila × Jia Ping Xia →02 BridgeOpen career →Jia Ping Xia
1 meeting01September 29, 1997View Jia Ping Xia × Mikael Tillstrom →03 BridgeOpen career →Mikael Tillstrom
1 meeting01September 18, 2000View Mikael Tillstrom × Roger Federer →04 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 3 links. Every route travels the shortest possible distance in the archive.
- OriginDanilo Pila
- BridgeJia Ping Xia
- BridgeHyung Taik Lee
- DestinationRoger Federer
- OriginDanilo Pila
- BridgeJia Ping Xia
- BridgeSjeng Schalken
- DestinationRoger Federer
- OriginDanilo Pila
- BridgeBing Pan
- BridgeRichard Krajicek
- DestinationRoger Federer
- OriginDanilo Pila
- BridgeBing Pan
- BridgeJerome Golmard
- 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 →