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
Danilo Pila
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 →2 meetings20October 9, 2000 — June 17, 2002View Roger Federer × Richard Krajicek →02 BridgeOpen career →Richard Krajicek
1 meeting10April 8, 1996View Richard Krajicek × Bing Pan →03 BridgeOpen career →Bing Pan
1 meeting10March 30, 1990View Bing Pan × Danilo Pila →04 DestinationOpen career →Danilo Pila
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
- BridgeMikael Tillstrom
- BridgeJia Ping Xia
- DestinationDanilo Pila
- OriginRoger Federer
- BridgeJerome Golmard
- BridgeBing Pan
- DestinationDanilo Pila
- OriginRoger Federer
- BridgeHyung Taik Lee
- BridgeJia Ping Xia
- DestinationDanilo Pila
- OriginRoger Federer
- BridgeSjeng Schalken
- BridgeJia Ping Xia
- DestinationDanilo Pila
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 →