更改

无编辑摘要
第119行: 第119行:  
  A two-dimensional Boolean matrix, in which the rows represent the vertices and columns represent the edges. The entries indicate whether the vertex at a row is incident to the edge at a column.
 
  A two-dimensional Boolean matrix, in which the rows represent the vertices and columns represent the edges. The entries indicate whether the vertex at a row is incident to the edge at a column.
   −
一个二维布尔矩阵,其中行表示顶点,列表示边。'''<font color="#32CD32">矩阵的条目值</font>'''The entries 表明行上的顶点是否与列上的边相关联。--信白该句存疑
+
一个二维布尔矩阵,其中行表示顶点,列表示边。'''<font color="#32CD32">矩阵的条目值</font>'''The entries 表明行上的顶点是否与列上的边相关联。--信白信白该句存疑
      第127行: 第127行:  
The following table gives the time complexity cost of performing various operations on graphs, for each of these representations, with |V | the number of vertices and |E | the number of edges. In the matrix representations, the entries encode the cost of following an edge. The cost of edges that are not present are assumed to be ∞.
 
The following table gives the time complexity cost of performing various operations on graphs, for each of these representations, with |V | the number of vertices and |E | the number of edges. In the matrix representations, the entries encode the cost of following an edge. The cost of edges that are not present are assumed to be ∞.
   −
下表给出了在图上执行各种操作的'''<font color="#ff8000">时间复杂度time complexity</font>''',对于每个表示,用 | <big>V</big> | 顶点数和 | <big>E</big> | 边数。在矩阵表示中,条目值跟随边的代价进行编码。假定不存在的边的代价为∞。
+
下表给出了在图上执行各种操作的'''<font color="#ff8000">时间复杂度time complexity</font>''',对于每个表示,用 | <big>V</big> | 顶点数和 | <big>E</big> | 边数。在矩阵表示中,'''<font color="#32CD32">条目值</font>'''跟随边的代价进行编码。假定不存在的边的代价为∞。
     
274

个编辑