计算无向图中的Prime Cliques数量

给定一个具有N个节点和E个边的图，任务是计算其大小为给定图中的素数或节点素数的团数。

A clique is a complete subgraph of a given graph.

例子：

Input: N = 5, edges[] = { {1, 2}, {2, 3}, {3, 1}, {4, 3}, {4, 5}, {5, 3} } 
 

Output: 8 
Explanation: 
In the given undirected graph, 1->2->3 and 3->4->5 are the two complete subgraphs, both of them are of size 3 which is a prime. 
Also, 1-2, 2->3, 3->1, 4->3, 4->5 and 5->3 are complete subgraphs of size 2. 
Hence there are 8 prime cliques. 

方法：要解决上述问题，主要思想是使用递归。找到度大于或等于(K-1)的所有顶点，并检查K个顶点的哪个子集形成一个集团。将另一条边添加到当前列表时，将检查是否通过添加该边来确定列表是否仍然是集团。可以按照以下步骤计算结果：

• 要检查集团的大小是否为素数，我们的想法是使用erathesthenes筛网。创建一个筛子，这将有助于我们确定尺寸是否为O(1)时间的质数。
• 用三个参数构成一个递归函数：起始节点，当前节点集的长度和素数数组(以检查素数)。
• 起始索引类似于不能将少于该索引的节点添加到当前集中。因此，循环从该索引运行到n。
• 发现在将节点添加到当前集中后，该节点集仍然是团团。如果是，则添加该节点，然后检查当前组的大小，如果为素数，则将答案增加1，然后使用新添加的节点的参数索引+ 1，当前集合的长度+ 1调用递归函数。和素数数组。
• 将添加顶点，直到列表不形成集团为止。最后，打印出包含主要集团数量的答案。

下面是上述方法的实现：

C++

// C++ implementation to Count the number
// of Prime Cliques in an undirected graph
 
#include 
using namespace std;
 
const int MAX = 100;
 
// Stores the vertices
int store[MAX], n;
 
// Graph
int graph[MAX][MAX];
 
// Degree of the vertices
int d[MAX];
 
// To store the count of prime cliques
int ans;
 
// Function to create
// Sieve to check primes
void SieveOfEratosthenes(
    bool prime[], int p_size)
{
    // false here indicates
    // that it is not prime
    prime[0] = false;
    prime[1] = false;
 
    for (int p = 2; p * p <= p_size; p++) {
 
        // Condition if prime[p]
        // is not changed,
        // then it is a prime
        if (prime[p]) {
 
            // Update all multiples of p,
            // set them to non-prime
            for (int i = p * 2; i <= p_size; i += p)
                prime[i] = false;
        }
    }
}
 
// Function to check
// if the given set of
// vertices in store array
// is a clique or not
bool is_clique(int b)
{
 
    // Run a loop for all set of edges
    for (int i = 1; i < b; i++) {
        for (int j = i + 1; j < b; j++)
 
            // If any edge is missing
            if (graph[store[i]][store[j]] == 0)
                return false;
    }
    return true;
}
 
// Function to find the count of
// all the cliques having prime size
void primeCliques(int i, int l,
                  bool prime[])
{
    // Check if any vertices from i+1
    // can be inserted
    for (int j = i + 1; j <= n; j++) {
 
        // Add the vertex to store
        store[l] = j;
 
        // If the graph is not
        // a clique of size k then
        // it cannot be a clique
        // by adding another edge
        if (is_clique(l + 1)) {
 
            // increase the count of
            // prime cliques if the size
            // of current clique is prime
            if (prime[l])
                ans++;
 
            // Check if another edge
            // can be added
            primeCliques(j, l + 1, prime);
        }
    }
}
 
// Driver code
int main()
{
    int edges[][2] = { { 1, 2 },
                       { 2, 3 },
                       { 3, 1 },
                       { 4, 3 },
                       { 4, 5 },
                       { 5, 3 } };
 
    int size = sizeof(edges)
               / sizeof(edges[0]);
    n = 5;
 
    bool prime[n + 1];
    memset(prime, true, sizeof(prime));
 
    SieveOfEratosthenes(prime, n + 1);
 
    for (int i = 0; i < size; i++) {
        graph[edges[i][0]][edges[i][1]] = 1;
        graph[edges[i][1]][edges[i][0]] = 1;
        d[edges[i][0]]++;
        d[edges[i][1]]++;
    }
 
    ans = 0;
    primeCliques(0, 1, prime);
 
    cout << ans << "\n";
 
    return 0;
}

Java

// Java implementation to Count the number
// of Prime Cliques in an undirected graph
import java.io.*;
import java.util.*;
 
class GFG {
     
static final int MAX = 100;
 
// Stores the vertices
static int[] store = new int[MAX];
static int n;
 
// Graph
static int[][] graph = new int[MAX][MAX];
 
// Degree of the vertices
static int[] d = new int[MAX];
 
// To store the count of prime cliques
static int ans;
 
// Function to create
// Sieve to check primes
static void SieveOfEratosthenes(boolean prime[],
                                int p_size)
{
     
    // False here indicates
    // that it is not prime
    prime[0] = false;
    prime[1] = false;
 
    for(int p = 2; p * p <= p_size; p++)
    {
         
       // Condition if prime[p]
       // is not changed,
       // then it is a prime
       if (prime[p])
       {
            
           // Update all multiples of p,
           // set them to non-prime
            for(int i = p * 2; i <= p_size; i += p)
               prime[i] = false;
       }
    }
}
 
// Function to check
// if the given set of
// vertices in store array
// is a clique or not
static boolean is_clique(int b)
{
 
    // Run a loop for all set of edges
    for(int i = 1; i < b; i++)
    {
       for(int j = i + 1; j < b; j++)
        
          // If any edge is missing
          if (graph[store[i]][store[j]] == 0)
             return false;
    }
    return true;
}
 
// Function to find the count of
// all the cliques having prime size
static void primeCliques(int i, int l,
                         boolean prime[])
{
     
    // Check if any vertices from i+1
    // can be inserted
    for(int j = i + 1; j <= n; j++)
    {
        
       // Add the vertex to store
       store[l] = j;
        
       // If the graph is not
       // a clique of size k then
       // it cannot be a clique
       // by adding another edge
       if (is_clique(l + 1))
       {
            
           // Increase the count of
           // prime cliques if the size
           // of current clique is prime
           if (prime[l])
               ans++;
                
           // Check if another edge
           // can be added
           primeCliques(j, l + 1, prime);
       }
    }
}
     
// Driver code
public static void main(String[] args)
{
    int edges[][] = { { 1, 2 },
                      { 2, 3 },
                      { 3, 1 },
                      { 4, 3 },
                      { 4, 5 },
                      { 5, 3 } };
 
    int size = edges.length;
    n = 5;
 
    boolean[] prime = new boolean[n + 1];
    Arrays.fill(prime, true);
 
    SieveOfEratosthenes(prime, n);
 
    for(int i = 0; i < size; i++)
    {
       graph[edges[i][0]][edges[i][1]] = 1;
       graph[edges[i][1]][edges[i][0]] = 1;
       d[edges[i][0]]++;
       d[edges[i][1]]++;
    }
     
    ans = 0;
    primeCliques(0, 1, prime);
 
    System.out.println(ans);
}
}
 
// This code is contributed by coder001

Python3

# Python3 implementation to Count the number
# of Prime Cliques in an undirected graph
MAX = 100
  
# Stores the vertices
store = [0 for i in range(MAX)]
n = 0
  
# Graph
graph = [[0 for j in range(MAX)]
            for i in range(MAX)]
  
# Degree of the vertices
d = [0 for i in range(MAX)]
  
# To store the count of prime cliques
ans = 0
  
# Function to create
# Sieve to check primes
def SieveOfEratosthenes(prime, p_size):
     
    # false here indicates
    # that it is not prime
    prime[0] = False
    prime[1] = False
     
    p = 2
     
    while (p * p <= p_size):
         
        # Condition if prime[p]
        # is not changed,
        # then it is a prime
        if (prime[p]):
             
            # Update all multiples of p,
            # set them to non-prime
            for i in range(p * 2, p_size + 1, p):
                prime[i] = False
                 
        p += 1
         
# Function to check if the given
# set of vertices in store array
# is a clique or not
def is_clique(b):
  
    # Run a loop for all set of edges
    for i in range(1, b):
        for j in range(i + 1, b):
  
            # If any edge is missing
            if (graph[store[i]][store[j]] == 0):
                return False
     
    return True
 
# Function to find the count of
# all the cliques having prime size
def primeCliques(i, l, prime):
     
    global ans
     
    # Check if any vertices from i+1
    # can be inserted
    for j in range(i + 1, n + 1):
  
        # Add the vertex to store
        store[l] = j
  
        # If the graph is not
        # a clique of size k then
        # it cannot be a clique
        # by adding another edge
        if (is_clique(l + 1)):
  
            # Increase the count of
            # prime cliques if the size
            # of current clique is prime
            if (prime[l]):
                ans += 1
  
            # Check if another edge
            # can be added
            primeCliques(j, l + 1, prime)
     
# Driver code
if __name__=='__main__':
     
    edges = [ [ 1, 2 ], [ 2, 3 ],
              [ 3, 1 ], [ 4, 3 ],
              [ 4, 5 ], [ 5, 3 ] ]
     
    size = len(edges)
     
    n = 5
  
    prime = [True for i in range(n + 2)]
  
    SieveOfEratosthenes(prime, n + 1)
  
    for i in range(size):
        graph[edges[i][0]][edges[i][1]] = 1
        graph[edges[i][1]][edges[i][0]] = 1
        d[edges[i][0]] += 1
        d[edges[i][1]] += 1
     
    ans = 0
    primeCliques(0, 1, prime)
     
    print(ans)
 
# This code is contributed by rutvik_56

C#

// C# implementation to count the number
// of Prime Cliques in an undirected graph
using System;
 
class GFG{
     
static readonly int MAX = 100;
 
// Stores the vertices
static int[] store = new int[MAX];
static int n;
 
// Graph
static int[,] graph = new int[MAX, MAX];
 
// Degree of the vertices
static int[] d = new int[MAX];
 
// To store the count of prime cliques
static int ans;
 
// Function to create
// Sieve to check primes
static void SieveOfEratosthenes(bool []prime,
                                int p_size)
{
     
    // False here indicates
    // that it is not prime
    prime[0] = false;
    prime[1] = false;
 
    for(int p = 2; p * p <= p_size; p++)
    {
        
       // Condition if prime[p]
       // is not changed,
       // then it is a prime
       if (prime[p])
       {
            
           // Update all multiples of p,
           // set them to non-prime
           for(int i = p * 2; i <= p_size;
                   i += p)
              prime[i] = false;
       }
    }
}
 
// Function to check if the given
// set of vertices in store array
// is a clique or not
static bool is_clique(int b)
{
 
    // Run a loop for all set of edges
    for(int i = 1; i < b; i++)
    {
       for(int j = i + 1; j < b; j++)
        
          // If any edge is missing
          if (graph[store[i],store[j]] == 0)
              return false;
    }
    return true;
}
 
// Function to find the count of
// all the cliques having prime size
static void primeCliques(int i, int l,
                         bool []prime)
{
     
    // Check if any vertices from i+1
    // can be inserted
    for(int j = i + 1; j <= n; j++)
    {
        
       // Add the vertex to store
       store[l] = j;
        
       // If the graph is not
       // a clique of size k then
       // it cannot be a clique
       // by adding another edge
       if (is_clique(l + 1))
       {
            
           // Increase the count of
           // prime cliques if the size
           // of current clique is prime
           if (prime[l])
               ans++;
            
           // Check if another edge
           // can be added
           primeCliques(j, l + 1, prime);
       }
    }
}
     
// Driver code
public static void Main(String[] args)
{
    int [,]edges = { { 1, 2 },
                     { 2, 3 },
                     { 3, 1 },
                     { 4, 3 },
                     { 4, 5 },
                     { 5, 3 } };
                      
    int size = edges.GetLength(0);
    n = 5;
 
    bool[] prime = new bool[n + 1];
    for(int i = 0; i < prime.Length; i++)
       prime[i] = true;
 
    SieveOfEratosthenes(prime, n);
 
    for(int i = 0; i < size; i++)
    {
       graph[edges[i, 0],edges[i, 1]] = 1;
       graph[edges[i, 1],edges[i, 0]] = 1;
       d[edges[i, 0]]++;
       d[edges[i, 1]]++;
    }
     
    ans = 0;
    primeCliques(0, 1, prime);
 
    Console.WriteLine(ans);
}
}
 
// This code is contributed by Princi Singh

输出：

8