Live adjacency, degree, and Laplacian

Click two vertices to add or remove the edge between them. The matrices A, D, and L = D − A update after every change. Verify the handshake theorem: the degree sum shown below is always twice the number of edges. The graph begins as the four-vertex cycle used in the article.

degree sum
2 × |E|
check

A · adjacency
D · degree
L = D − A · Laplacian