GraphLab › Adjacency matrix
The adjacency matrix of a graph with n vertices is an n × n table. The entry in row i and column j counts the edges from vertex i to vertex j (or holds the edge weight in a weighted graph). For an undirected graph the matrix is symmetric.
Each step adds one edge to the adjacency matrix. Choose Incidence matrix or Distance matrix in the Algorithm menu for the others.