Densidade grafo

The graph density calculator computes the density of an undirected graph, showing how many edges exist compared to the maximum possible. The formula used is 2E/(V(V−1)), where E is the number of edges and V the number of vertices. This metric is crucial for network analysis, graph theory, and connectivity studies in complex systems.

To use the calculator, input the edges and vertices values. The result indicates the proportion of edges relative to the theoretical maximum (V(V−1)/2). A density of 1 means a complete graph, while values near 0 suggest sparse graphs. The calculation assumes no loops or multiple edges between the same pair of vertices.

This tool is useful for social network analysis, transportation models, or optimization algorithms. For example, in urban connectivity studies, density can reveal whether a city has evenly distributed infrastructure. Note: For directed graphs, the formula changes to E/(V(V−1)), as each edge has a direction.

Invalid values (like E > V(V−1)/2) will trigger an error, as no graph can have more edges than the theoretical maximum. Validate inputs before calculating. Density helps compare graphs of different sizes by normalizing edge count relative to graph scale.