Python Data Structures and Algorithms

Adjacency matrix

Another approach by which a graph can be represented is by using an adjacency matrix. A matrix is a two-dimensional array. The idea here is to represent the cells with a 1 or 0 depending on whether two vertices are connected by an edge.

Given an adjacency list, it should be possible to create an adjacency matrix. A sorted list of keys of graph is required:

    matrix_elements = sorted(graph.keys())     cols = rows = len(matrix_elements) 

The length of the keys is used to provide the dimensions of the matrix which are stored in cols and rows. These values in cols and rows are equal:

    adjacency_matrix = [[0 for x in range(rows)] for y in range(cols)]     edges_list = [] 

We then set up a cols by rows array, filling it with zeros. The ...