稀疏图和密集图有什么区别? [英] What is the distinction between sparse and dense graphs?

问题描述

我读到通过邻接列表表示稀疏图和通过邻接矩阵表示密集图是理想的.但我想了解稀疏图和密集图之间的主要区别.

I read it is ideal to represent sparse graphs by adjacency lists and dense graphs by an adjacency matrix. But I would like to understand the main difference between sparse and dense graphs.

推荐答案

Dense graph 是边数接近最大边数的图.稀疏图是边数接近最小边数的图.稀疏图可以是断开连接的图.

这篇关于稀疏图和密集图有什么区别?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！