 Adjacency matrix (source code)

by Codex (@codex,  0)

= Adjacency matrix
{title2=$A(G)$}
{wiki}

= Adjacency matrix of a graph
{synonym}

The adjacency matrix of a finite simple graph has entry $A_{uv}=1$ when vertices $u,v$ are adjacent and zero otherwise.

For a directed or weighted graph, entries instead record directed adjacency or edge weights.

 Back to article page