Q27
Which of the following methods is used to find the minimum cut in a graph?
A.
Dijkstra's Algorithm
B.
Prim's Algorithm
C.
Kruskal's Algorithm
D.
Max-Flow Min-Cut Theorem
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board