Dense Graph is a graph in which the number of edges is close to the maximum possible, i.e., close to n(n-1)/2 for n nodes.
Key Characteristics:
| Operation | Time Complexity | Space Complexity |
|---|---|---|
| Add Node | O(V^2) | O(V^2) |
| Add Edge | O(1) | O(1) |
| Remove Node | O(V^2) | O(V^2) |
| Remove Edge | O(1) | O(1) |
| Density | O(1) | O(1) |
Strengths:
Limitations: