题目很简单，我没用教材上给的图结构，不然太麻烦了，这是个无加全的无向图。。。一个二维数组就搞定了
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 |
#include<iostream> #include<malloc.h> #include<queue> #define max 50 using namespace std; int map[max][max]; int flag[max]; int n, e; void dfs(int v){ flag[v] = 1; cout <<" "<<v; for (int i = 0; i < n; i++) { if (!flag[i] && map[v][i]) dfs(i); } } void bfs(int v){ queue<int> q; flag[v] = 1; cout <<" "<<v; q.push(v); while (!q.empty()) { int tmp = q.front(); q.pop(); for (int i = 0; i < n; i++) { if (!flag[i] && map[tmp][i]) { flag[i] = 1; cout <<" "<<i; q.push(i); } } } } int main() { cin >> n >> e; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { map[i][j] = 0; map[j][i] = 0; } } for (int i = 0; i < e; i++) { int tmpi, tmpj; cin >> tmpi >> tmpj; map[tmpi][tmpj] = 1; map[tmpj][tmpi] = 1; } for (int i = 0; i < n; i++) { flag[i] = 0; } for (int i = 0; i < n; i++) { if (!flag[i]) { cout << "{"; dfs(i); cout << " }"<<endl; } } for (int i = 0; i < n; i++) { flag[i] = 0; } for (int i = 0; i < n; i++) { if (!flag[i]) { cout << "{"; bfs(i); cout << " }" << endl;; } } } |
