1

Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?

Correct Answer: graph m has 3 distinct minimum spanning trees, each of cost 2

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Design and Analysis of Algorithms MCQ: Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true? | Extra Education