hdu 5952 Counting Cliques

Counting Cliques

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2630    Accepted Submission(s): 966


Problem Description
A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is to count the number of cliques with a specific size S in the graph. 
 

Input
The first line is the number of test cases. For each test case, the first line contains 3 integers N,M and S (N ≤ 100,M ≤ 1000,2 ≤ S ≤ 10), each of the following M lines contains 2 integers u and v (1 ≤ u < v ≤ N), which means there is an edge between vertices u and v. It is guaranteed that the maximum degree of the vertices is no larger than 20.
 

Output
For each test case, output the number of cliques with size S in the graph.
 

Sample Input
      
3 4 3 2 1 2 2 3 3 4 5 9 3 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5 4 5 6 15 4 1 2 1 3 1 4 1 5 1 6 2 3 2 4 2 5 2 6 3 4 3 5 3 6 4 5 4 6 5 6
 

Sample Output
      
3 7 15
 

Source
 

Recommend
jiangzijing2015
 

Statistic |  Submit |  Discuss |  Note


因为是稀疏图所以对边进行暴力就行。


#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int mark[105][105];
int stack[105];
int u=0,v=0;
int res=0;
int n,m,k;
vector<int>G[105];
void dfs(int p)
{
    if(v==k)
    {
        res++;
        return;
    }
    for(int i=0;i<G[p].size();i++)
    {
        int tmp = G[p][i];
        //if(vis[tmp])continue;
        bool Flag=true;
        for(int j=0;j<v;j++)
        {
            if(!mark[tmp][stack[j]])
            {
                Flag=false;
                break;
            }
        }
        if(Flag)
        {
            stack[v++]=tmp;
            dfs(tmp);
            v--;
        }
    }
    return;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        u=0,v=0;
        res=0;
        for(int i=0;i<100;i++)
            G[i].clear();
        scanf("%d%d%d",&n,&m,&k);
        int x,y;
        memset(mark,0,sizeof(mark));
        memset(vis,0,sizeof(vis));
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&x,&y);
            if(y<x)
            {
                G[y].push_back(x);
            }
            else G[x].push_back(y);
            mark[y][x]=mark[x][y]=1;
        }
        for(int i=1;i<=n;i++)
        {
            stack[v++]=i;
            dfs(i);
            v--;
        }
        printf("%d\n",res);
    }
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值