OJ Board

Posted: **Fri Dec 19, 2003 3:29 pm**

Which algorithm is the best for finding the connected components in a graph ?

10x

Posted: **Fri Dec 19, 2003 9:15 pm**

Breadth-First Search and Depth-First Search both run in linear time (wrt the size of the graph).