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
Miha Gregorc
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 meeting01April 28, 2000View Miha Gregorc × Karim Maamoun →02 BridgeOpen career →Karim Maamoun
1 meeting01July 21, 2006View Karim Maamoun × Marcos Baghdatis →03 BridgeOpen career →Marcos Baghdatis
8 meetings17August 30, 2004 — August 15, 2010View Marcos Baghdatis × Roger Federer →04 DestinationOpen career →Roger Federer
Parallel routes
One search may have several correct answers.
Besides the detailed route, we found 2 more sequences with the same 3 links. Every route travels the shortest possible distance in the archive.
- OriginMiha Gregorc
- BridgeKarim Maamoun
- BridgeSergiy Stakhovsky
- DestinationRoger Federer
- OriginMiha Gregorc
- BridgeKarim Maamoun
- BridgeBlaz Kavcic
- 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 →