Computer Science · Algorithms
Kruskal's algorithm for finding the Minimum Spanning Tree (MST) of a graph sorts all the edges by:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Vertex degree
- 2Increasing weight✓
- 3Decreasing path length
- 4Random order
Correct answer
Increasing weight
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms