最大独立点集
最大匹配:二分图G中,找出边数最大的子图M,使得M中各条边均无公共顶点,则M为最大匹配。可用匈牙利算法求得。
最大独立集:在二分图G中,找出点数最多的子图M,使得M中各点之间都不相连。
最大独立集 = 顶点数 - 最大匹配
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define INF (int)(1e9)
#define maxn 1010
using namespace std;
typedef long long ll;
int p = 0;
struct node {
int to, w, next;
};
node edge[maxn * maxn];
int head[maxn];
void add_edge(int u, int v, int w) {
edge[p].to = v;
edge[p].w = w;
edge[p].next = head[u];
head[u] = p;
++ p;
}
int Mx[maxn],My[maxn],uN,vN;
int dx[maxn],dy[maxn],dis;
bool vis[maxn];
bool search_path() {
queue<int> Q;
dis = INF;
memset(dx, -1, sizeof(dx));
memset(dy, -1, sizeof(dy));
for (int i = 0; i < uN; i++)
if(Mx[i] == -1) {
Q.push(i);
dx[i] = 0;
}
while (!Q.empty()) {
int u = Q.front();
Q.pop();
if (dx[u] > dis) break;
int v;
for (int k = head[u]; k != -1; k = edge[k].next) {
v = edge[k].to;
if (dy[v] == -1) {
dy[v] = dx[u] + 1;
if (My[v] == -1) dis = dy[v];
else {
dx[My[v]] = dy[v]+1;
Q.push(My[v]);
}
}
}
}
return dis != INF;
}
bool dfs(int u) {
int v;
for (int k = head[u]; k != -1; k = edge[k].next) {
v = edge[k].to;
if (!vis[v] && dy[v]==dx[u]+1) {
vis[v] = 1;
if (My[v] != -1 && dy[v] == dis) continue;
if(My[v] == -1 || dfs(My[v])) {
My[v] = u;
Mx[u] = v;
return true;
}
}
}
return false;
}
int max_match() {
int res = 0;
memset(Mx, -1, sizeof(Mx));
memset(My, -1, sizeof(My));
while (search_path()) {
memset(vis, 0, sizeof(vis));
for (int i = 0; i < uN; i ++)
if (Mx[i] == -1 && dfs(i)) res ++;
}
return res;
}
struct Node {
string Keep, Throw;
}g[maxn];
int main() {
int t;
scanf("%d", &t);
while (t --) {
p = 0, memset(head, -1, sizeof(head));
int c, d, v;
scanf("%d%d%d", &c, &d, &v);
for (int i = 0; i < v; ++ i) {
cin >> g[i].Keep >> g[i].Throw;
}
for (int i = 0; i < v; ++ i) {
for (int j = 0; j < v; ++ j) if (g[i].Keep == g[j].Throw || g[i].Throw == g[j].Keep) {
add_edge(i,j,0);
}
}
uN = vN = v;
cout << v-max_match()/2 << endl;
}
}