Question 1261 – Algorithms
November 23, 20230/1-Knapsack-and-fractional-knapsack
November 23, 2023Question 7869 – Algorithms
Consider the following undirected graph G:
Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is _________.
Correct Answer: A
Question 5 Explanation:
Here, x = 5 because it is having maximum number of spanning trees.
If x = 5 then the total number of MWSTs are 4.
If r = 1
If r = 2
If r = 3
If r = 4
If r = 5
If x = 5 then the total number of MWSTs are 4.
If r = 1
If r = 2
If r = 3
If r = 4
If r = 5
4
5
6
7
Subscribe
Login
0 Comments