https://www.acmicpc.net/problem/1260 #include #define endl "\n"using namespace std;pair vertex[1002];vector> edge;vector v;queue bfschk;void dfs(int start) { if (vertex[start].second == true) { v.push_back(start); vertex[start].second = false; for (int i = 0; i 0) { int num = bfschk.front(); bfschk.pop(); bfs(num); }}bool compare(pair x, pair y) { if (x.first == y.first) return x.second ..