补充博客

• 本次测试总体难度适中，要点在于掌握英语准确翻译

• An undirected graph is a graph where the pairings representing the edges are _____________.

  • Unordered无序

• Two vertices in a graph are ___________ if there is an edge connecting them.

  • B .Adjacent 相邻的

• An undirected graph is considered complete if it has the maximum number of edges connecting vertices.

  • C .Complete

• A _________ is a sequence of edges that connects two vertices in a graph.

  • B .Path 路径

• A ________ is a path in which the first and last vertices are the same and none

  • D .Cycle 闭环

• A minimum spanning tree is a spanning tree where the sum of the weights of the edges is greater than or equal to the sum of the weights for any other spanning tree for the same graph.

  • B .false
  • 要小于或等于

• A spanning tree is a tree that includes all of the edges of a graph and some, but possibly not all, of the vertices.

  • B .false

• 生成树的定义不是这个，要包含所有顶点

• A graph is connected if and only if the number of vertices in the breadth-first traversal is the same as the number of vertices in the graph regardless of the starting vertex.

  • B .false（与开始顶点有关）

• The only difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a queue instead of a stack to manage the traversal.

  • B .false （栈）

• A network, or a weighted graph, is a graph with weights or costs associated with each edge.

  • A .true(网的定义)

• A path is a sequence of edges that connects two vertices in a graph.

  • A .true（重复)

• Two vertices in a graph are adjacent if there is an edge connecting them.

  • A .true（与上重复）

• A minimum spanning tree is a spanning tree where the sum of the weights of the edges is ____________ to the sum of the weights for any other spanning tree for the same graph.

  • A .Less than or equal（最小生成树边会少）

• The only difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a _________ instead of a queue to manage the traversal.

  • A .Stack 根据书本内容可知