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
Mike Bolton
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 OriginOpen career →1 meeting01March 18, 1968View Mike Bolton × Rolf Harms →02 BridgeOpen career →Rolf Harms
1 meeting01March 18, 1968View Rolf Harms × Andras Szikszay →03 BridgeOpen career →Andras Szikszay
1 meeting01April 15, 1968View Andras Szikszay × Teimuraz Kakulia →04 BridgeOpen career →Teimuraz Kakulia
1 meeting01February 10, 1975View Teimuraz Kakulia × Jimmy Connors →05 BridgeOpen career →Jimmy Connors
1 meeting10May 15, 1989View Jimmy Connors × Cedric Pioline →06 BridgeOpen career →Cedric Pioline
1 meeting01September 13, 1999View Cedric Pioline × 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.
- OriginMike Bolton
- BridgeRolf Harms
- BridgeAndras Szikszay
- BridgeTeimuraz Kakulia
- BridgeJimmy Connors
- BridgeByron Black
- DestinationRoger Federer
- OriginMike Bolton
- BridgeRolf Harms
- BridgeAndras Szikszay
- BridgeTeimuraz Kakulia
- BridgeJimmy Connors
- BridgeAndre Agassi
- DestinationRoger Federer
- OriginMike Bolton
- BridgeRolf Harms
- BridgeAndras Szikszay
- BridgeTeimuraz Kakulia
- BridgeJimmy Connors
- BridgeTodd Martin
- DestinationRoger Federer
- OriginMike Bolton
- BridgeRolf Harms
- BridgeAndras Szikszay
- BridgeTeimuraz Kakulia
- BridgeJimmy Connors
- BridgeMarc Rosset
- 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 →