代码搜索:Maximum
找到约 9,165 项符合「Maximum」的源代码
代码结果 9,165
www.eeworm.com/read/445660/7592211
txt maximum flow.txt
/*
网络最大流
*/
/*
步骤:1,BFS ;
*/
#include
#define Max 2000000000 //初始值,与题目数据有关;
#define N 418 //节点个数;
struct
www.eeworm.com/read/309305/13674729
m filter_maximum.m
function varargout = filter_maximum(varargin)
if nargin == 0
p1 = struct( ...
'Name', 'Radius (in pixel)', ...
'Style', 'integer', ...
'DefaultValue', 3, ...
'Max', 64, .
www.eeworm.com/read/308927/13687344
m filter_maximum.m
function varargout = filter_maximum(varargin)
if nargin == 0
p1 = struct( ...
'Name', 'Radius (in pixel)', ...
'Style', 'integer', ...
'DefaultValue', 3, ...
'Max', 64, .
www.eeworm.com/read/327092/6347905
jpg maximum_rpm.jpg
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/307576/13720335
ppt day15_maximum_flow.ppt
www.eeworm.com/read/127087/6008743
a-maximum-rrset knowngood.dig.out.a-maximum-rrset
; DiG 8.2 a-maximum-rrset.example. @10.53.0.1 a -p
; (1 server found)
;; res options: init recurs defnam dnsrch
;; got answer:
;; ->>HEADER
www.eeworm.com/read/263158/11373177
txt maximum matching on general graph.txt
#include
// total is the maximum cardinality,p[1..n] means a match : i p[i]
#define maxn 10
int g [maxn][maxn],p[maxn],l[maxn][3],n,total,status[maxn],visited[maxn];
void upgrade(int
www.eeworm.com/read/175466/5346417
a-maximum-rrset knowngood.dig.out.a-maximum-rrset
; DiG 8.2 a-maximum-rrset.example. @10.53.0.1 a -p
; (1 server found)
;; res options: init recurs defnam dnsrch
;; got answer:
;; ->>HEADER
www.eeworm.com/read/333376/3387915
a-maximum-rrset knowngood.dig.out.a-maximum-rrset
; DiG 8.2 a-maximum-rrset.example. @10.53.0.1 a -p
; (1 server found)
;; res options: init recurs defnam dnsrch
;; got answer:
;; ->>HEADER