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
Miha Gregorc
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 →8 meetings71August 30, 2004 — August 15, 2010View Roger Federer × Marcos Baghdatis →02 BridgeOpen career →Marcos Baghdatis
1 meeting10July 21, 2006View Marcos Baghdatis × Karim Maamoun →03 BridgeOpen career →Karim Maamoun
1 meeting10April 28, 2000View Karim Maamoun × Miha Gregorc →04 DestinationOpen career →Miha Gregorc
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.
- OriginRoger Federer
- BridgeSergiy Stakhovsky
- BridgeKarim Maamoun
- DestinationMiha Gregorc
- OriginRoger Federer
- BridgeBlaz Kavcic
- BridgeKarim Maamoun
- DestinationMiha Gregorc
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 →