Graph density

Graph density measures how interconnected a network is by comparing the number of actual connections (edges) to the maximum possible connections between nodes (points). In simple terms, it shows how full or sparse a network is. A dense graph has many connections relative to the number of nodes, indicating strong relationships or high interaction. Conversely, a sparse graph has fewer connections, suggesting weaker links or fewer interactions. The density value ranges from 0 (no connections) to 1 (every node connected to every other). It helps analyze the overall connectivity and cohesiveness of the network.