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
Petros Baghdatis
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 →15 meetings141April 15, 2007 — February 12, 2018View Roger Federer × Andreas Seppi →02 BridgeOpen career →Andreas Seppi
1 meeting10July 16, 2004View Andreas Seppi × Yordan Kanev →03 BridgeOpen career →Yordan Kanev
1 meeting10July 20, 2007View Yordan Kanev × Petros Baghdatis →04 DestinationOpen career →Petros Baghdatis
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
- BridgeMarcos Baghdatis
- BridgeYordan Kanev
- DestinationPetros Baghdatis
- OriginRoger Federer
- BridgeMarcos Baghdatis
- BridgeSherif Sabry
- DestinationPetros Baghdatis
- OriginRoger Federer
- BridgeGrega Zemlja
- BridgeSherif Sabry
- DestinationPetros Baghdatis
- OriginRoger Federer
- BridgeErnests Gulbis
- BridgeSherif Sabry
- DestinationPetros Baghdatis
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 →