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
Milos Dimitrijevic
Historical windowComplete archive
The connection uses 4 links and 5 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 meetings11April 2, 1999 — February 28, 2000View Roger Federer × Gianluca Pozzi →02 BridgeOpen career →Gianluca Pozzi
1 meeting01January 4, 1993View Gianluca Pozzi × Stefan Edberg →03 BridgeOpen career →Stefan Edberg
1 meeting01October 29, 1984View Stefan Edberg × Sandy Mayer →04 BridgeOpen career →Sandy Mayer
1 meeting10February 10, 1975View Sandy Mayer × Milos Dimitrijevic →05— DestinationOpen career →Milos Dimitrijevic
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 4 more sequences with the same 4 links. Every route travels the shortest possible distance in the archive.
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeBoris Becker
- BridgeSandy Mayer
- —DestinationMilos Dimitrijevic
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeVijay Amritraj
- BridgeSandy Mayer
- —DestinationMilos Dimitrijevic
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeKevin Curren
- BridgeSandy Mayer
- —DestinationMilos Dimitrijevic
- OriginRoger Federer
- BridgeGianluca Pozzi
- BridgeIvan Lendl
- BridgeSandy Mayer
- —DestinationMilos Dimitrijevic
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 →