# Connect

Computer Science Level pending

What is the time complexity of the most efficient algorithm, for finding the number of connected components in an undirected graph of $$n$$ vertices and $$m$$ edges?

×

Problem Loading...

Note Loading...

Set Loading...