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
Brian Page
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 meeting10July 18, 1988View Brian Page × Pieter Aldrich →02 BridgeOpen career →Pieter Aldrich
2 meetings02May 2, 1988 — August 28, 1989View Pieter Aldrich × Michael Chang →03 BridgeOpen career →Michael Chang
5 meetings14January 17, 2000 — August 26, 2002View Michael Chang × 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.
- OriginBrian Page
- BridgeDarren Cahill
- BridgeFrancisco Clavet
- DestinationRoger Federer
- OriginBrian Page
- BridgeDarren Cahill
- BridgeGuillaume Raoux
- DestinationRoger Federer
- OriginBrian Page
- BridgeDarren Cahill
- BridgeMagnus Larsson
- DestinationRoger Federer
- OriginBrian Page
- BridgeDarren Cahill
- BridgeAndre Agassi
- 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 →