Computer Science · Algorithms
गैर-नकारात्मक किनारों के भार (non-negative edge weights) वाले एक वेटेड ग्राफ (weighted graph) में निम्नलिखित में से कौन सा एल्गोरिथम सबसे छोटे मार्ग (shortest path) की गारंटी देता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1क्रुस्कल एल्गोरिथम (Kruskal's Algorithm)
- 2डिजकस्ट्रा एल्गोरिथम (Dijkstra's Algorithm)✓
- 3ब्रेडथ-फर्स्ट सर्च (BFS)
- 4डेप्थ-फर्स्ट सर्च (DFS)
सही उत्तर देखें
डिजकस्ट्रा एल्गोरिथम (Dijkstra's 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