Really fast.

for (int k = 0; k < n; ++k) {
  for (int i = graph[k]._Find_first(); i < n; i = graph[k]._Find_next(i)) {
    graph[k] |= graph[i];
  }
}