C言語で最大クリーク問題を解きたい

Question

グラフに含まれる最大のクリーク（完全グラフ）を求める最大クリーク問題を解くプログラムを実現したいです．これはNP完全問題です．
隣接行列を使い、解きたいです。

#include<stdio.h>

#define N 100

int a[N][N]={
};

int v[N];


for(j = 1; j <= N; j++){
      if( a[i][j] == 1 && v[j] == 0 ){
	//printf("%d->%d\n ", i, j);
	
      }
 }

int main(void)
 {
   int i;

   for(i = 0; i < N; i++){
     V[i] = 0;
   }
 }
   

全然できていませんがここまでしかわかりませんでした。
隣接行列は
{0,0,0,1,0,1,0,1,0,0,0,0,0,1,1,1,1,0,0,1,0,0,0,1,1,1,1,0,0,0},
{0,0,1,1,0,1,0,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,1,0,1,0},
{0,1,0,0,1,1,1,0,0,0,1,1,0,1,0,0,0,0,1,0,0,1,0,0,1,0,1,0,1,1},
{1,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,1,0,0,1,1,0,0,0,1},
{0,0,1,1,0,1,1,1,1,0,1,1,0,1,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0,1},
{1,1,1,0,1,0,1,0,1,1,0,1,0,1,1,1,1,0,1,1,0,1,0,1,0,1,1,1,1,0},
{0,0,1,0,1,1,0,1,0,1,0,0,0,0,1,0,1,0,1,1,1,0,1,1,1,0,0,0,0,1},
{1,0,0,0,1,0,1,0,1,1,0,0,0,1,0,0,1,0,0,0,0,0,1,1,1,0,0,0,0,1},
{0,0,0,1,1,1,0,1,0,0,0,1,0,0,1,1,0,1,0,0,0,1,0,0,0,1,0,0,1,0},
{0,1,0,1,0,1,1,1,0,0,1,0,1,1,1,1,0,1,0,0,1,1,0,0,1,1,1,0,1,1},
{0,0,1,1,1,0,0,0,0,1,0,1,1,1,0,1,0,1,0,0,0,0,0,0,0,1,1,1,1,0},
{0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,1,1,1,1,0,1,1,0,1,0,0,1,1,0,1},
{0,0,0,0,0,0,0,0,0,1,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,1,0,0,0,0},
{1,1,1,1,1,1,0,1,0,1,1,0,1,0,0,1,1,0,1,1,1,1,1,1,0,1,0,1,1,0},
{1,1,0,1,1,1,1,0,1,1,0,0,0,0,0,1,1,0,1,1,1,1,0,1,1,0,1,0,0,1},
{1,1,0,0,1,1,0,0,1,1,1,1,0,1,1,0,0,0,1,1,1,1,0,1,1,1,1,1,1,0},
{1,0,0,1,1,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,0,1,0,1,0,0},
{0,0,0,0,1,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,1,0,0},
{0,1,1,1,0,1,1,0,0,0,0,1,1,1,1,1,0,0,0,1,1,1,0,1,1,1,1,0,1,0},
{1,1,0,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,1,0,1},
{0,0,0,0,0,0,1,0,0,1,0,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,1,0,0,0},
{0,1,1,1,0,1,0,0,1,1,0,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,0,1,1,0},
{0,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,1,0,0,0,1,0,0,1,1,1,1,1,0,0},
{1,1,0,0,0,1,1,1,0,0,0,1,1,1,1,1,1,0,1,0,1,1,1,0,1,0,0,0,1,1},
{1,1,1,1,0,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0,0,1,1,1,0,1,1,1,1,0},
{1,1,0,1,0,1,0,0,1,1,1,0,1,1,0,1,1,0,1,1,1,1,1,0,1,0,1,1,1,1},
{1,1,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,0,1,0,1,1,0,0,1,1},
{0,0,0,0,1,1,0,0,0,0,1,1,0,1,0,1,1,1,0,1,0,1,1,0,1,1,0,0,0,0},
{0,1,1,0,0,1,0,0,1,1,1,0,0,1,0,1,0,0,1,0,0,1,0,1,1,1,1,0,0,0},
{0,0,1,1,1,0,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0,0,0,1,0,1,1,0,0,0}
で、N=30です。

Comments

[jimbe]

本当に何も出来ていませんが、「解きたいです」では単に希望を述べられているだけです。
原因を考えて対処せねばなりませんが、この状態から進めないのは原因は何(が分からない為)だとお考えでしょうか。

[fana]

N=30 とかだと動作や結果の確認にも一苦労しそうなので
最初はもっと小さい入力を相手にして検討してみてはどうでしょう．

[ppaul]

過去の質問への回答に対してまったく無反応な質問者は、回答を期待しないほうが良いですよ。
https://teratail.com/questions/344760