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.
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxv = 60;
int g[maxv][maxv], dp[maxv], stk[maxv][maxv], mx;
int dfs(int n, int ns, int dep)
{
if (0 == ns) {
if (dep > mx) mx = dep;
return 1;
}
int i......
阅读全文