Origin
Open career →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
John Haak
reaches
Roger Federer
Historical windowComplete archive
The connection uses 6 links and 7 careers. Every step below represents a recorded head-to-head meeting within the selected window.
The complete route
Career by career
01 1 meeting01September 22, 1968View John Haak × Gary Hippenstiel →02 BridgeOpen career →Gary Hippenstiel
1 meeting10September 22, 1968View Gary Hippenstiel × Oscar Chiarella →03 BridgeOpen career →Oscar Chiarella
1 meeting01November 12, 1976View Oscar Chiarella × Julio Goes →04 BridgeOpen career →Julio Goes
1 meeting01September 29, 1986View Julio Goes × Ronald Agenor →05 BridgeOpen career →Ronald Agenor
1 meeting01June 12, 2000View Ronald Agenor × Gianluca Pozzi →06 BridgeOpen career →Gianluca Pozzi
2 meetings11April 2, 1999 — February 28, 2000View Gianluca Pozzi × Roger Federer →07 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 6 links. Every route travels the shortest possible distance in the archive.
- OriginJohn Haak
- BridgeGary Hippenstiel
- BridgeOscar Chiarella
- BridgeJulio Goes
- BridgeRonald Agenor
- BridgeFrancisco Clavet
- DestinationRoger Federer
- OriginJohn Haak
- BridgeGary Hippenstiel
- BridgeOscar Chiarella
- BridgeJulio Goes
- BridgeRonald Agenor
- BridgeCedric Pioline
- DestinationRoger Federer
- OriginJohn Haak
- BridgeGary Hippenstiel
- BridgeOscar Chiarella
- BridgeJulio Goes
- BridgeRonald Agenor
- BridgeByron Black
- DestinationRoger Federer
- OriginJohn Haak
- BridgeGary Hippenstiel
- BridgeOscar Chiarella
- BridgeJulio Goes
- BridgeRonald Agenor
- BridgeGuillaume Raoux
- 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 →