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
Wei Jen Cheng
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 →2 meetings11February 28, 2000 — June 12, 2000View Roger Federer × Magnus Larsson →02 BridgeOpen career →Magnus Larsson
1 meeting10January 1, 1996View Magnus Larsson × Sultan Khalfan →03 BridgeOpen career →Sultan Khalfan
1 meeting01April 2, 1999View Sultan Khalfan × Wei Jen Cheng →04 DestinationOpen career →Wei Jen Cheng
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.
- OriginRoger Federer
- BridgeMarc Rosset
- BridgeSuwandi Suwandi
- DestinationWei Jen Cheng
- OriginRoger Federer
- BridgeMarc Rosset
- BridgeSultan Khalfan
- DestinationWei Jen Cheng
- OriginRoger Federer
- BridgeYounes El Aynaoui
- BridgeSuwandi Suwandi
- DestinationWei Jen Cheng
- OriginRoger Federer
- BridgeJonas Bjorkman
- BridgeAisam Ul Haq Qureshi
- DestinationWei Jen Cheng
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 →