代码搜索：Clique
找到约 304 项符合「Clique」的源代码
代码结果 304
www.eeworm.com/read/358191/10194144
out bbclique.out
enter number of edges
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
enter edge 8
enter edge 9
enter edge 10
Size of max clique is 4
Vertex sele
www.eeworm.com/read/358191/10194535
out bclique.out
enter number of edges of 7 vertex graph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
enter edge 8
enter edge 9
enter edge 10
Size of max clique
www.eeworm.com/read/281000/10273923
cpp fig04_72.cpp
// Computes a map in which the keys are words and values are vectors of words
// that differ in only one character from the corresponding key.
// Uses an efficient algorithm that is O(N log N) with
www.eeworm.com/read/161587/10393637
out bbclique.out
enter number of edges
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
enter edge 8
enter edge 9
enter edge 10
Size of max clique is 4
Vertex sele
www.eeworm.com/read/161587/10394778
out bclique.out
enter number of edges of 7 vertex graph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
enter edge 8
enter edge 9
enter edge 10
Size of max clique
www.eeworm.com/read/421666/10713515
h glpscg.h
/* glpscg.h (sparse cliqued graph) */
/***********************************************************************
* This code is part of GLPK (GNU Linear Programming Kit).
*
* Copyright (C) 2000,01,02
www.eeworm.com/read/272848/10941153
output testbtmaxclique.output
Enter number of edges in 7 vertex graph
Enter unweighted edge 1
Enter unweighted edge 2
Enter unweighted edge 3
Enter unweighted edge 4
Enter unweighted edge 5
Enter unweighted edge 6
Enter unw
www.eeworm.com/read/470683/6905834
cpp kccliques.dynamic.cpp
#include
#include
#include
#include "KCGlobal.h"
#include "KCDataset.h"
#include "KCUtility.h"
using namespace std;
void initializeNodeList(KCDataset& dataset, K
www.eeworm.com/read/469138/6978228
txt 最大团.txt
//最大团
//返回最大团大小和一个方案,传入图的大小n和邻接阵mat
//mat[i][j]为布尔量
#define MAXN 60
void clique(int n, int* u, int mat[][MAXN], int size, int& max, int& bb, int* res, int* rr, int* c) {
int i, j, vn, v[MAXN
www.eeworm.com/read/468861/6980685
h crf.h
/****************************************************************************************************************/
/* Pocket CRF 0.45
/* Copyright(c) 2005-2008 Taku Kudo
/***********