All Graphs in Which Each Pair of Distinct Vertices Has Exactly Two Common Neighbors

We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.