A parallel program is presented that determines the connected components of an undirected graph in time 0(log²n) using n² processors. It is assumed that the processors have access to common memory. Simultaneous access to the same location is permitted for fetch, but not store, instructions.