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
Tai Wei Liu
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 meeting01February 6, 2004View Tai Wei Liu × Vadim Kutsenko →02 BridgeOpen career →Vadim Kutsenko
1 meeting01September 14, 1998View Vadim Kutsenko × Cedric Pioline →03 BridgeOpen career →Cedric Pioline
1 meeting01September 13, 1999View Cedric Pioline × 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.
- OriginTai Wei Liu
- BridgeVadim Kutsenko
- BridgeDaniel Vacek
- DestinationRoger Federer
- OriginTai Wei Liu
- BridgeVadim Kutsenko
- BridgeYounes El Aynaoui
- DestinationRoger Federer
- OriginTai Wei Liu
- BridgeVadim Kutsenko
- BridgeAlex Corretja
- DestinationRoger Federer
- OriginTai Wei Liu
- BridgeVadim Kutsenko
- BridgeJiri Novak
- 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 →