Graph Density A sparse graph has O(|V|) edges
{"Image DocumentName": "Graph Density A sparse graph has O(|V|) edges", "Image ImageDescription": "Why is the adjacency list likely to be a better representation than the adjacency matrix for sparse graphs? Sparse graphs have too few edges to fit in an adjacency matrix. Much of the matrix will be wasted on 0s. The adjacency list will guarantee better performance on a sparse graph. None of these. Graph density is a measure of the number of edges. Remember that we need to analyze graphs in terms of both |E| and |V|. If we know the density of the graph, we can dispense with that.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}