稀疏图和密集图之间的区别是什么？ [英] What is the distinction between sparse and dense graphs?

问题描述

我正在阅读在计算机内存中表示图形的方法。我看到它是通过邻接列表和邻近矩阵的密集图表示稀疏图的理想选择。但我想了解稀疏图和密集图之间的主要区别？

解决方案

密集图是边缘数量接近最大边缘数量的图形。
稀疏图是边缘数量接近最小边数的图形。稀疏图可以是断开图表。

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.

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