代码搜索：Clique
找到约 304 项符合「Clique」的源代码
代码结果 304
www.eeworm.com/read/473179/6857581
txt 最大团(n小于64)(faster).txt
/**
* WishingBone's ACM/ICPC Routine Library
*
* maximum clique solver
*/
#include
using std::vector;
// clique solver calculates both size and consitution of maximum clique
www.eeworm.com/read/473191/6857988
txt 最大团(n小于64)(faster).txt
/**
* WishingBone's ACM/ICPC Routine Library
*
* maximum clique solver
*/
#include
using std::vector;
// clique solver calculates both size and consitution of maximum clique
www.eeworm.com/read/201477/15407565
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/201477/15407644
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/470683/6905874
cpp kccliques.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/168218/9932594
cpp bbclique.cpp
// test branch-and-bound max clique
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(8);
int n = 7, p[8];
cout
www.eeworm.com/read/168218/9933261
cpp bbclique.cpp
// test branch-and-bound max clique
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(8);
int n = 7, p[8];
cout
www.eeworm.com/read/358191/10194503
cpp bbclique.cpp
// test branch-and-bound max clique
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(8);
int n = 7, p[8];
cout
www.eeworm.com/read/161587/10394683
cpp bbclique.cpp
// test branch-and-bound max clique
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(8);
int n = 7, p[8];
cout
www.eeworm.com/read/421666/10713146
dat dragon.dat
/* dragon.dat, a hard Paint-By-Numbers puzzle */
/* To reduce the solution time the clique cuts may be used. */
data;
param m := 20;
param n := 20;
param row : 1 2 3 4 5 :=
1