Graph Playground

Draw a graph and watch its matrices change with it. Everything runs in your browser.

Click empty space to add a vertex · click one vertex then another to join or unjoin them · drag to move · click an edge to delete it · right-click a vertex to remove it.

This graph
    Classical identities
    Spectrum

      Buneman's four point condition: for any four vertices i, j, k, l of a tree, the largest of the three sums below is attained at least twice. It is the condition that decides whether a set of measured distances can come from a tree at all, and the Min4PC and Max4PC matrices are built from it.