Programming, Computer Science, Graph Theory, Graph, Mathematics.
matrix or an incidence matrix. Adjacency Matrix An adjacency matrix, M, for a directed graph with n vertices is called an n x n matrix. M(i, j) is equal to 1 if (i, j) has an edge from i to j M(i, j) is otherwise 0. An adjacency list is where each vertex, u, has a list of vertices pointed to by an