Solved

In a Graph G, If the Edges Connecting Two Vertices

Question 26

Multiple Choice

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

Related Questions

Q21: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering

Q22: A graph G is a pair, G

Q23: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering

Q24: In a graph directed G, for each

Q25: A simple path is a path in

Q27: The _ algorithm gives the shortest distance

Q28: A minimal spanning tree of G is

Q29: The _ of sets A and B

Q30: If two edges, e<sub>1</sub> and e<sub>2</sub>, are

Q31: The two most common graph traversal algorithms