Assertion: matrix's entry | /r/Desires | only one bit
Facets:
Source sentences:
text: Because each entry in the adjacency matrix requires only one bit, it can be represented in a very compact way, occupying only |V |2/8 bytes to represent a directed graph, or (by using a packed triangular format and only storing the lower triangular part of the matrix) approximately |V |2/16 bytes to represent an undirected graph.