Tennis.esp.br

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.

Choose both ends of the storyComplete archive · walkovers excluded
→
Historical windowOnly matches played within this period may create links.
No date limit

Shortest path found

Roger Federer
reaches
Y Wang

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

2,483 players examined
  1. 1 meeting10February 27, 2006
    View Roger Federer × Mohammad Ghareeb →
  2. 1 meeting01February 9, 2001
    View Mohammad Ghareeb × Ali Hamadeh →
  3. 1 meeting01October 6, 2000
    View Ali Hamadeh × Y Wang →

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 →