HDU ACM 1530 Maximum clique-> Largest group

Analysis: The largest group of template problems, Dfs deep search.

#include <iostream>using namespace std; #define N 55int map[n][n];int set[n];int max;bool isconnect (int end,int v) { int I;for (i=0;i<end;i++) if (!map[set[i]][v]) return False;return true; void DFS (int depth,int u,int n) {int i;if (depth+ (n-(u-1)) <=max)  //Pruning, no return at the back than the previous large; for (i=u;i<=n;i++) if (Isconnect (depth,i)) {Set[depth]=i;dfs (depth+1,i+1,n);    Recursive search sequential node}if (DEPTH>MAX)       //Update Max Max=depth;} int main () {int n,i,j;while (scanf ("%d", &n) ==1 && N) {for (i=1;i<=n;i++) for (j=1;j<=n;j++) scanf ("%d", &MAP[I][J]); Max=0;dfs (0,1,n);             Search printf from the first vertex of layer No. 0 ("%d\n", Max);} return 0;}

HDU ACM 1530 Maximum clique-> Largest group