我正在读的方式来重新present图在计算机内存中。我的理解是非常重present稀疏图由邻接表和密集的图形由邻接矩阵。不过，我想明白疏与密图之间的主要区别是什么？

I was reading on ways to represent graphs in computer memory . I read it is ideal to represent sparse graphs by adjacency lists and dense graphs by adjacency matrix . But I would like to understand the main difference between sparse and dense graphs ?

推荐答案

密图为图中的边数是接近边缘的最大数目。 稀疏图是曲线图，在其中边的数目为接近边缘的最小数量。稀疏图可以是断开图表。

Dense graph is a graph in which the number of edges is close to the maximal number of edges. Sparse graph is a graph in which the number of edges is close to the minimal number of edges. Sparse graph can be a disconnected graph.