代码搜索：Clique
找到约 304 项符合「Clique」的源代码
代码结果 304
www.eeworm.com/read/478955/6708644
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/407513/11417987
cc aodv.cc
/*
Copyright (c) 1997, 1998 Carnegie Mellon University. All Rights
Reserved.
Permission to use, copy, modify, and distribute this
software and its documentation is hereby granted (including for
com
www.eeworm.com/read/403717/11512757
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/400753/11569547
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/157453/11704075
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/157453/11704283
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/259580/11781533
h adjacencygraph.h
// adjacency matrix representation of an undirected graph
#ifndef adjacencyGraph_
#define adjacencyGraph_
#include
#include
#include
#include "adjacencyWGraph
www.eeworm.com/read/132141/14107474
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/132141/14107638
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