23 std::vector<std::vector<int>>* components) {
24 if (components ==
nullptr) {
25 AERROR <<
"components is not available";
28 int num_item =
static_cast<int>(graph.size());
29 std::vector<int> visited;
30 visited.resize(num_item, 0);
32 std::vector<int> component;
33 component.reserve(num_item);
36 for (
int index = 0; index < num_item; ++index) {
40 component.push_back(index);
43 while (!que.empty()) {
44 int current_id = que.front();
46 for (
size_t sub_index = 0; sub_index < graph[current_id].size();
48 int neighbor_id = graph[current_id][sub_index];
49 if (visited[neighbor_id] == 0) {
50 component.push_back(neighbor_id);
51 que.push(neighbor_id);
52 visited[neighbor_id] = 1;
56 components->push_back(component);