The maximum value of such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is ________. (Answer in integer)


AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)NAT2 marksMedium

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