During the execution of CONNECTED-COMPONENTS on an undirected graph GD= (V.E) with k connected components, how many
Fantastic news! We've Found the answer you've been seeking!
Question:
During the execution of CONNECTED-COMPONENTS on an undirected graph GD= (V.E) with k connected components, how many times is FIND-SET called? How many times is UNION called? Express your answers in terms of |V|, |E|, and k .
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: