代码搜索：Clique
找到约 304 项符合「Clique」的源代码
代码结果 304
www.eeworm.com/read/211952/15169991
cpp p1492_maxclique.cpp
// zju 1492
// max clique
#include
bool found;
int N;
int c [50] , max;
bool Line [50] [50];
struct set {
int Size;
bool Contain [50];
www.eeworm.com/read/473179/6857582
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/473191/6857989
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/266379/11229249
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/201477/15407256
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/201477/15407645
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/168218/9932518
cpp bclique.cpp
// test backtracking max clique
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(8);
int n = 7, p[8];
cout
www.eeworm.com/read/168218/9932637
h ag.h
// file ag.h
// adjacency matrix representation of a graph
// final version
#ifndef AdjacencyGraph_
#define AdjacencyGraph_
#include "aw.h"
#include "bbnode.h"
#include "clnode.h"
#inclu
www.eeworm.com/read/168218/9933091
cpp bclique.cpp
// test backtracking max clique
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(8);
int n = 7, p[8];
cout
www.eeworm.com/read/168218/9933100
h ag.h
// file ag.h
// adjacency matrix representation of a graph
// final version
#ifndef AdjacencyGraph_
#define AdjacencyGraph_
#include "aw.h"
#include "bbnode.h"
#include "clnode.h"
#inclu