Q952
What is the running time of implementing a min-cut algorithm using bidirected edges in a graph?
A.
O(N)
B.
O(N log N)
C.
O(N4)
AnswerD.
O(N2)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board