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
Petros Baghdatis
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 meeting01July 20, 2007View Petros Baghdatis × Yordan Kanev →02 BridgeOpen career →Yordan Kanev
1 meeting01July 16, 2004View Yordan Kanev × Andreas Seppi →03 BridgeOpen career →Andreas Seppi
15 meetings114April 15, 2007 — February 12, 2018View Andreas Seppi × 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.
- OriginPetros Baghdatis
- BridgeYordan Kanev
- BridgeMarcos Baghdatis
- DestinationRoger Federer
- OriginPetros Baghdatis
- BridgeSherif Sabry
- BridgeMarcos Baghdatis
- DestinationRoger Federer
- OriginPetros Baghdatis
- BridgeSherif Sabry
- BridgeGrega Zemlja
- DestinationRoger Federer
- OriginPetros Baghdatis
- BridgeSherif Sabry
- BridgeErnests Gulbis
- 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 →