代码搜索：Clique
找到约 304 项符合「Clique」的源代码
代码结果 304
www.eeworm.com/read/459616/7270475
dat clique2.dat
14
1 2
1 4
2 4
2 3
2 5
2 6
3 5
3 6
4 5
5 6
7 2
7 5
7 3
7 6
www.eeworm.com/read/157453/11704076
dat clique2.dat
14
1 2
1 4
2 4
2 3
2 5
2 6
3 5
3 6
4 5
5 6
7 2
7 5
7 3
7 6
www.eeworm.com/read/338498/12304790
bak clique.cpp.bak
#include "stdafx.h"
#include "Network.h"
#include "Clique.h"
#include "EventSim.h"
#include "Routing.h"
/* global variables */
extern NODE_TYPE nodeT[4000];
extern NETWORK_TYPE net;
exte
www.eeworm.com/read/132141/14107476
dat clique2.dat
14
1 2
1 4
2 4
2 3
2 5
2 6
3 5
3 6
4 5
5 6
7 2
7 5
7 3
7 6
www.eeworm.com/read/201477/15407566
dat clique2.dat
14
1 2
1 4
2 4
2 3
2 5
2 6
3 5
3 6
4 5
5 6
7 2
7 5
7 3
7 6
www.eeworm.com/read/200429/15433509
mat clique-10.mat
www.eeworm.com/read/287260/8699333
m clique_energy_ho.m
function e=clique_energy_ho(d,p,th,quant)
%clique_energy_ho Computes clique energy: e=th^(p-2)*d.^2.*mask + d.^p.*(1-mask)
% e=clique_energy_ho(d,p,th,quant)
%
% Input arguments ---------
www.eeworm.com/read/405817/11456352
cpp maximum clique(最大团).cpp
#include
#include
#define NMAX 51
bool path[NMAX][NMAX];
int n, mmax;
int dp[NMAX];
bool v[NMAX];
bool dfs(int pos, int size)
{
int i, j, unvis;
bool tv[NMAX];
www.eeworm.com/read/167182/9978870
cpp maxclique.cpp
// adjacency matrix representation of a graph
#include
class Clique
{
friend MaxClique(int**, int[],int);
public:
void Backtrack(int);
int **a, // 图G的邻接矩阵
n,