GATE CS 2025 (Forenoon) — Question 64

AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)NAT2 marksMedium

The maximum value of \( x \) 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)
Question image
Practise the full 2025-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Minimum Spanning Trees (Prim/Kruskal Algorithms)Timed, in the real exam interface · free to start

A GATE question every morning

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

Join
Stuck? Ask in the student group