Is connected_components of a compressed_graph possible?

Hi,

I migrated code from v2.  Have the code
```
    std::vector<size_t> component(graph::num_vertices((g)));
    graph::connected_components(g, component);
```
Is connected_components algorithm still possible for compressed_graph?

Did some searching and don't see any tests coverage so I'm unsure.