274
个编辑
更改
跳到导航
跳到搜索
第389行：
第389行： − 邻接表通常是首选的，因为它们能有效地表示稀疏图。如果图是稠密的，那么邻接矩阵是首选的，即边的数目 |<big>E</big>| 接近于顶点的平方数，|<big>V</big>|<sup>2</sup> ，或者说如果有一条边连接两个顶点，那么所选取的数据结构必须能满足快速查找到数据才行。+ − −
→Representations
Adjacency lists are generally preferred because they efficiently represent sparse graphs. An adjacency matrix is preferred if the graph is dense, that is the number of edges |E | is close to the number of vertices squared, |V |<sup>2</sup>, or if one must be able to quickly look up if there is an edge connecting two vertices.
Adjacency lists are generally preferred because they efficiently represent sparse graphs. An adjacency matrix is preferred if the graph is dense, that is the number of edges |E | is close to the number of vertices squared, |V |<sup>2</sup>, or if one must be able to quickly look up if there is an edge connecting two vertices.
邻接表通常是首选的，因为它们能有效地表示'''<font color="#ff8000">稀疏图sparse graph</font>'''。如果图是'''<font color="#ff8000">稠密图dense graph</font>'''的，那么邻接矩阵是首选的，即边的数目 |<big>E</big>| 接近于顶点的平方数，|<big>V</big>|<sup>2</sup> ，或者说如果有一条边连接两个顶点，那么所选取的数据结构必须能满足快速查找到数据才行。
== Parallel Graph Representations ==
== Parallel Graph Representations ==