A(n) ____ is a subset of the edges of a graph such that there is only one edge between each vertex, and all of the vertices are connected.
A) adjacency matrix
B) spanning tree
C) maze
D) iterator

Question

Quizplus · Accepted Answer

A spanning tree is a subset of the edges of a graph that connects all the vertices together without any cycles and with the minimum possible number of edges, ensuring there is exactly one path between any two vertices.

A(n) ____ Is a Subset of the Edges of a Graph