Question

The memory use of an adjacency matrix is​

Answer 1

Answer:

Explanation:

Yes, it is used for adjacency Matrix as well

Answer 2

Answer:

An adjacency matrix (at 1 bit per edge) requires n * (1) bits of memory for any directed graph.

Explanation:

• Define adjacency matrix

The mapping of the associations between the network nodes is done using a 2D matrix. The adjacency matrix of a network with n vertices is n x n, and each item in the matrix reflects the number of edges connecting a given vertice to another.

• An adjacency matrix can be used to represent a network as a matrix of boolean values (0s and 1s). A square matrix can be employed to represent a finite graph on a computer, and the matrix's boolean value can be used to verify if there is a direct path connecting any two vertices.
• The adjacency matrix has a spatial complexity of O (V 2) O(V2 O (V2). In terms of storage needs, an adjacency list is more effective for describing a graph.