Question

The memory use of an adjacency matrix is​

Answer 1

Answer:

For any directed graph, an adjacency matrix (at 1 bit per edge) consumes n^2 * (1) bits of memory. ... For an adjacency list, you can use the follow formula to determine the maximum number of edges ( e ) before an adjacency matrix is optimal for memory.

Answer 2

$\Huge{\textbf{\textsf{{\color{navy}{An}}{\purple{sw}}{\pink{er}}{\color{pink}{:}}}}}$

For any directed graph, an adjacency matrix (at 1 bit per edge) consumes n^2 * (1) bits of memory. ... For an adjacency list, you can use the follow formula to determine the maximum number of edges ( e ) before an adjacency matrix is optimal for memory.