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
F Egyir
reaches
Roger Federer
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 →1 meeting10July 12, 2002View F Egyir × Tsolak Gevorgyan →02 BridgeOpen career →Tsolak Gevorgyan
1 meeting01July 20, 2001View Tsolak Gevorgyan × Solon Peppas →03 BridgeOpen career →Solon Peppas
1 meeting01August 23, 1999View Solon Peppas × Greg Rusedski →04 BridgeOpen career →Greg Rusedski
5 meetings14October 11, 1999 — April 11, 2005View Greg Rusedski × Roger Federer →05 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 4 links. Every route travels the shortest possible distance in the archive.
- OriginF Egyir
- BridgeTsolak Gevorgyan
- BridgeSolon Peppas
- BridgeAlbert Portas
- DestinationRoger Federer
- OriginF Egyir
- BridgeTsolak Gevorgyan
- BridgeSolon Peppas
- BridgeAlberto Martin
- DestinationRoger Federer
- OriginF Egyir
- BridgeTsolak Gevorgyan
- BridgeSolon Peppas
- BridgeKristian Pless
- DestinationRoger Federer
- OriginF Egyir
- BridgeTsolak Gevorgyan
- BridgeSolon Peppas
- BridgeJanko Tipsarevic
- 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 →