Q364
Which of the following algorithm can be used to find the minimum cut of a connected graph?
A.
Fleury's algorithm
B.
Hirschberg's algorithm
C.
Karger's algorithm
AnswerD.
Hierholzer's algorithm
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board