Computer Science · Algorithms
In the standard implementation of Prim’s Minimum Spanning Tree (MST) algorithm using a min-priority queue, what does the queue store to select the next step?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The list of all edges sorted by weight
- 2All paths from the starting node
- 3Vertices along with their minimum key weights to the growing MST✓
- 4Edges that are not yet in the MST
Correct answer
Vertices along with their minimum key weights to the growing MST
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