Consider the following undirected graph with edge weights as shown: The number…

GATE · 2021 · CS · Set 1 · Computer Science & IT

Consider the following undirected graph with edge weights as shown:

 The number of minimum-weight spanning trees of the graph is ___________.

Attempted by 225 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…