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

Hartmut Bielefeld
reaches
Roger Federer

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

3,481 players examined
  1. 1 meeting01January 22, 1968
    View Hartmut Bielefeld × Eric Drossart →
  2. 2 meetings02May 24, 1968 — May 28, 1969
    View Eric Drossart × Jan Kodes →
  3. 6 meetings06November 28, 1972 — September 1, 1976
    View Jan Kodes × Jimmy Connors →
  4. 1 meeting10May 15, 1989
    View Jimmy Connors × Cedric Pioline →
  5. 1 meeting01September 13, 1999
    View Cedric Pioline × Roger Federer →

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 →