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
Asaf Raja

Historical windowComplete archive

The connection uses 5 links and 6 careers. Every step below represents a recorded head-to-head meeting within the selected window.

The complete route

Career by career

4,645 players examined
  1. 2 meetings11April 2, 1999 — February 28, 2000
    View Roger Federer × Gianluca Pozzi →
  2. 1 meeting10April 8, 1996
    View Gianluca Pozzi × Brett Steven →
  3. 1 meeting10October 19, 1992
    View Brett Steven × Yu Hui Lien →
  4. 1 meeting10March 30, 1990
    View Yu Hui Lien × Hira Lal Rahman →
  5. 1 meeting10March 27, 1992
    View Hira Lal Rahman × Asaf Raja →

Parallel routes

One search may have several correct answers.

Besides the detailed route, we found 4 more sequences with the same 5 links. Every route travels the shortest possible distance in the archive.

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 →