ACM - 数据结构 | 极大团/最大团/最大独立集

极大团/最大团/最大独立集

简书：https://www.jianshu.com/p/437bd6936dad

Bron-Kerbosch Algorithm(Version 1)

//some-P集合 none-X集合 all-R集合
int some[maxn][maxn], none[maxn][maxn], all[maxn][maxn], mp[maxn][manx];
int ans;
void dfs(int d, int an, int sn, int nn){
    if(!sn && !nn) ++ ans;
    for(int i = 0; i < sn; ++i){
        int v = some[d][i];
        for(int j = 0; j < an; ++j) all[d+1][j] = all[d][j];
        all[d+1][an] = v;
        int tsn = 0, tnn = 0;
        for(int j = 0; j < sn; ++j) if(mp[v][some[d][j]]) some[d+1][tsn++] = some[d][j];
        for(int j = 0; j < nn; ++j) if(mp[v][none[d][j]]) none[d+1][tnn++] = none[d][j];
        dfs(d+1, an+1, tsn, tnn);
        some[d][i] = 0, none[d][nn++] = v;
    }
}

Bron-Kerbosch Algorithm(Version 2)

int mp[maxn][maxn];
int some[maxn][maxn], none[maxn][maxn], all[maxn][maxn];//P,X,R
int ans;
void dfs(int d, int an, int sn, int nn){
    if(!sn && !nn) ++ans;
    int u = some[d][0];
    for(int i = 0; i < sn; ++i){
        int v = some[d][i];
        if(mp[u][v]) continue;
        for(int j = 0; j < an; ++j) all[d+1][j] = all[d][j];
        all[d+1][an] = v;
        int tsn = 0, tnn = 0;
        for(int j = 0; j < sn; ++j) if(mp[v][some[d][j]]) some[d+1][tsn++] = some[d][j];
        for(int j = 0; j < nn; ++j) if(mp[v][none[d][j]]) none[d+1][tnn++] = none[d][j];
        dfs(d+1, an+1, tsn, tnn);
        some[d][i] = 0, none[d][nn++] = v;
    }
}

最大团

在每一次出现极大团的时候更新即可

int mp[maxn][maxn];
int some[maxn][maxn], none[maxn][maxn], all[maxn][maxn];//P,X,R
int ans;//最大团的顶点数
int p[maxn];//最大团的顶点
void dfs(int d, int an, int sn, int nn){
    if(!sn && !nn) {
        ans = max(ans, an);
    	for(int i = 0; i<an; i++) p[i] = some[d][i];
    }
    int u = some[d][0];
    for(int i = 0; i < sn; ++i){
        int v = some[d][i];
        if(mp[u][v]) continue;
        for(int j = 0; j < an; ++j) all[d+1][j] = all[d][j];
        all[d+1][an] = v;
        int tsn = 0, tnn = 0;
        for(int j = 0; j < sn; ++j) if(mp[v][some[d][j]]) some[d+1][tsn++] = some[d][j];
        for(int j = 0; j < nn; ++j) if(mp[v][none[d][j]]) none[d+1][tnn++] = none[d][j];
        dfs(d+1, an+1, tsn, tnn);
        some[d][i] = 0, none[d][nn++] = v;
    }
}

暴搜版本(更快)

int mp[105][105], se[105][105], g[105];
int ans;
bool dfs(int size, int dep){
	if (!size) {
		if (dep > ans) {
			ans = dep;
			return 1;
		}
		else return 0;
	}
	for (int i = 1; i <= size; i++){
		if (dep + size - i + 1 <= ans) return 0;
		int u = se[dep][i];
		if (dep + g[u] <= ans) return 0;
		int num = 0;
		for (int j = i + 1; j <= size; j++)
			if (mp[u][se[dep][j]]) se[dep + 1][++num] = se[dep][j];
		if (dfs(num, dep + 1)) return 1;
	}
	return 0;
}

void work(){
    ans = 0;
    memset(g, 0, sizeof(g));
    for (int i = id; i > 0; i--){
			int size = 0;
			for (int j = i + 1; j <= id; j++)
				if (mp[i][j]) se[1][++size] = j;
			dfs(size, 1);
			g[i] = ans;
		}
}

最大独立集

一个图的最大独立集就是其补图的最大团

int mp[maxn][maxn];
int some[maxn][maxn], none[maxn][maxn], all[maxn][maxn];//P,X,R
int ans;//最大团的顶点数
int p[maxn];//最大团的顶点
void dfs(int d, int an, int sn, int nn){
    if(!sn && !nn) {
        ans = max(ans, an);
    	for(int i = 0; i < an; i++) p[i] = some[d][i];
    }
    int u = some[d][0];
    for(int i = 0; i < sn; ++i){
        int v = some[d][i];
        if(mp[u][v]) continue;
        for(int j = 0; j < an; ++j) all[d+1][j] = all[d][j];
        all[d+1][an] = v;
        int tsn = 0, tnn = 0;
        for(int j = 0; j < sn; ++j) if(mp[v][some[d][j]]) some[d+1][tsn++] = some[d][j];
        for(int j = 0; j < nn; ++j) if(mp[v][none[d][j]]) none[d+1][tnn++] = none[d][j];
        dfs(d+1, an+1, tsn, tnn);
        some[d][i] = 0, none[d][nn++] = v;
    }
}

void getcg(){
	//获取补图,n和m视为图的size参数
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(mp[i][j]) mp[i][j] = 0;
            else mp[i][j] = 1;
        }
    }
}

暴搜版本(更快)

int mp[105][105], se[105][105], g[105];
int ans;
bool dfs(int size, int dep){
	if (!size) {
		if (dep > ans) {
			ans = dep;
			return 1;
		}
		else return 0;
	}
	for (int i = 1; i <= size; i++){
		if (dep + size - i + 1 <= ans) return 0;
		int u = se[dep][i];
		if (dep + g[u] <= ans) return 0;
		int num = 0;
		for (int j = i + 1; j <= size; j++)
			if (mp[u][se[dep][j]]) se[dep + 1][++num] = se[dep][j];
		if (dfs(num, dep + 1)) return 1;
	}
	return 0;
}

void work(){
    ans = 0;
    memset(g, 0, sizeof(g));
    for (int i = id; i > 0; i--){
			int size = 0;
			for (int j = i + 1; j <= id; j++)
				if (mp[i][j]) se[1][++size] = j;
			dfs(size, 1);
			g[i] = ans;
		}
}

void getcg(){
	//获取补图,n和m视为图的size参数
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(mp[i][j]) mp[i][j] = 0;
            else mp[i][j] = 1;
        }
    }
}