The cost of a(n) ____ is the sum of the weights of the edges.
A) spanning tree
B) depth-first search
C) adjacency matrix
D) breadth-first search

Question

Quizplus · Accepted Answer

The cost of a spanning tree is determined by the sum of the weights of the edges that make up the tree. This concept is fundamental in graph theory, especially in the context of finding minimum spanning trees where the goal is to connect all vertices with the least total edge weight.

The Cost of A(n) ____ Is the Sum of the Weights