In a graph G, if the edges connecting two vertices have weights assigned to them, the graph is called a ____ graph.
A) source
B) weighted
C) spanning
D) minimal

Name: In a graph G, if the edges connecting two vertices have weights assigned to them, the graph is called a ____ graph. A) source B) weighted C) spanning D) minimal
Brand: Quizplus
Rating: 4.7 (33 reviews)

Question

Quizplus · Accepted Answer

Weighted graphs are the ones in which the edges have weights assigned to them. The other options are not related to the presence of edge weights in the graph.

In a Graph G, If the Edges Connecting Two Vertices