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

Serge Dakessian
reaches
Pete Sampras

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

309 players examined
  1. 1 meeting01April 6, 2001
    View Serge Dakessian × Michael Brown B395 →
  2. 1 meeting01January 15, 1990
    View Michael Brown B395 × Karel Novacek →
  3. 2 meetings11May 6, 1991 — March 27, 1992
    View Karel Novacek × Pete Sampras →

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 →