Computer Science · Graph Algorithms
Match List-I with List-II: List-I (Algorithm/Concept) P. Bellman-Ford Algorithm Q. Prim's Algorithm R. Topological Sorting S. Floyd-Warshall Algorithm List-II (Definition/Property)1. Single-source shortest path algorithm handling negative edge weights and detecting negative cycles. 2. Linear ordering of vertices in a Directed Acyclic Graph (DAG) based on dependencies. 3. Minimum spanning tree algorithm starting with an arbitrary vertex and greedily adding minimum-weight edges. 4. All-pairs shortest path algorithm working even with negative edge weights. Choose the correct option matching P, Q, R, S in order:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 13-1-4-2
- 24-3-1-2
- 31-3-4-2
- 41-3-2-4✓
Correct answer
1-3-2-4
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 Graph Algorithms MCQs →Want more practice questions on Graph Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Algorithms