Graph, Graph Algorithm.
between a random pair of vertices, which means its adjacency matrix is filled up with many 0s. Therefore, storing a graph as its adjacency matrix will waste a lot of memory and storage. If you have a graph with 1 million vertices, then you need a 1 million x 1 million x 4 B (size of int) = 4 TB of