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
Dejan Petrovic

Historical windowComplete archive

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

The complete route

Career by career

355 players examined
  1. 4 meetings40May 28, 2001 — June 9, 2003
    View Roger Federer × Sargis Sargsian →
  2. 1 meeting10January 15, 2001
    View Sargis Sargsian × Dejan Petrovic →

Parallel routes

One search may have several correct answers.

Besides the detailed route, we found 4 more sequences with the same 2 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 →