Maximum Clique
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1906 Accepted Submission(s): 1033
Problem Description
Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there exists an edge (v1, v2) in e. Maximum clique is the clique that has maximum number of vertex.
Input
Input contains multiple tests. For each test:
The first line has one integer n, the number of vertex. (1 < n <= 50)
The following n lines has n 0 or 1 each, indicating whether an edge exists between i (line number) and j (column number).
A test with n = 0 signals the end of input. This test should not be processed.
The first line has one integer n, the number of vertex. (1 < n <= 50)
The following n lines has n 0 or 1 each, indicating whether an edge exists between i (line number) and j (column number).
A test with n = 0 signals the end of input. This test should not be processed.
Output
One number for each test, the number of vertex in maximum clique.
Sample Input
5 0 1 1 0 1 1 0 1 1 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 0 0
Sample Output
4
代码:
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
#define NMAX 55
bool path[NMAX][NMAX];
int n,mmax;
int dp[NMAX];
bool v[NMAX];
int seq[NMAX], seq_pos;
//seq记录最大团集合
bool dfs(int pos, int size)
{
int i, j, unvis;
bool tv[NMAX];
unvis = 0;
for (i=pos; i<n; i++)
{
if (!v[i])
{
unvis ++;
}
}
if (unvis == 0) //|U| = 0
{
if (size > mmax)
{
mmax = size;
seq_pos = 0;
seq[ seq_pos ++] = pos+1;
return true;
}
return false;
}
for (i=pos; i < n && unvis > 0 ; i++)
{
if (!v[i])
{
if (unvis + size <= mmax || dp[i] + size <= mmax)
{
return false;
}
v[i] = true;//U = U\{vi}
unvis --;
memcpy(tv, v, sizeof(v));
for (j=0; j<n; j++) //U ∩N(vi);
{
if (!path[i][j])
{
v[j] = true;
}
}
if ( dfs(i, size+1) )
{
seq[ seq_pos ++] = pos+1;
return true;
}
memcpy(v, tv, sizeof(v));
}
}//while U is not empty
return false;
}
int max_clique()
{
int i,j;
mmax = 0;
for (i=0; i<n; i++)
{
path[i][i] = false;
}
for (i=n-1; i>=0; i--)
{
for (j=0; j<n; j++) //Si ∩N(vi);
{
v[j] = !path[i][j];
}
dfs(i, 1);
dp[i] = mmax;
}
return mmax;
}
int main()
{
while(scanf("%d",&n))
{
if(n==0)
break;
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
scanf("%d",&path[i][j]);
}
}
printf("%d\n",max_clique());
}
return 0;
}