Computer Science · Algorithms
In optimizing a network graph where edges represent transfer fees, you need to find a subgraph that connects all vertices with the minimum total edge weight and without cycles. Sorting edges by weight and adding the lowest-weight edges that do not form a cycle describes which algorithm?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Dijkstra's shortest path algorithm
- 2Depth-first spanning tree algorithm
- 3Kruskal's minimum spanning tree algorithm✓
- 4Bellman-Ford relaxation algorithm
Correct answer
Kruskal's minimum spanning tree algorithm
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