Consider the following undirected graph with edge weights as shown:
The number of minimum-weight spanning trees of the graph is _________.

AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)NAT1 markHard

A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.