Supplementary blog

• An undirected graph is a graph where the pairings representing the edges are _____________.
  • Unordered disorder
• Two vertices in a graph are ___________ if there is an edge connecting them.
  • B .Adjacent 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.
  • Path 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