HI, is t possible to determine if a Graph is dense or sparse? I just found algorithms in Sparse or Dense. And I also found the formula D = |E| / |V| (|V|-1) . I'm missing something ?