代码搜索：模版匹配
找到约 3,092 项符合「模版匹配」的源代码
代码结果 3,092
www.eeworm.com/read/303158/13820624
pdf 图像匹配最大互相关快速算法.pdf
www.eeworm.com/read/301164/13865141
sql 生成查询的模糊匹配字符串.sql
if exists (select * from dbo.sysobjects where id = object_id(N'[dbo].[f_Sql]') and xtype in (N'FN', N'IF', N'TF'))
drop function [dbo].[f_Sql]
GO
if exists (select * from dbo.sysobjects where id
www.eeworm.com/read/488556/6489527
sql proc_销售发票与出库单匹配.sql
IF EXISTS (SELECT NAME FROM SYSOBJECTS WHERE NAME='PROC_销售发票与出库单匹配' AND TYPE='P')
DROP PROC PROC_销售发票与出库单匹配
GO
create PROC PROC_销售发票与出库单匹配
as
CREATE TABLE #AA
(
销售单号 INT,
发票金额 NUMERIC(18,6),
www.eeworm.com/read/478955/6708638
txt 一般图匹配(邻接表形式).txt
//一般图最大匹配,邻接表形式,复杂度O(n*e)
//返回匹配顶点对数,match返回匹配,未匹配顶点match值为-1
//传入图的顶点数n和邻接表list
#define MAXN 100
struct edge_t{
int from,to;
edge_t* next;
};
int aug(int n,edge_t* list[],int* match,int*
www.eeworm.com/read/478955/6708641
txt 一般图匹配(邻接阵形式).txt
//一般图最大匹配,邻接阵形式,复杂度O(n^3)
//返回匹配顶点对数,match返回匹配,未匹配顶点match值为-1
//传入图的顶点数n和邻接阵mat
#define MAXN 100
int aug(int n,int mat[][MAXN],int* match,int* v,int now){
int i,ret=0;
v[now]=1;
for (i=0;i
www.eeworm.com/read/478955/6708643
txt 一般图匹配(正向表形式).txt
//一般图最大匹配,正向表形式,复杂度O(n*e)
//返回匹配顶点对数,match返回匹配,未匹配顶点match值为-1
//传入图的顶点数n和正向表list,buf
#define MAXN 100
int aug(int n,int* list,int* buf,int* match,int* v,int now){
int i,t,ret=0;
v[now]=1;
www.eeworm.com/read/263494/11360997
sql 生成查询的模糊匹配字符串.sql
if exists (select * from dbo.sysobjects where id = object_id(N'[dbo].[f_Sql]') and xtype in (N'FN', N'IF', N'TF'))
drop function [dbo].[f_Sql]
GO
if exists (select * from dbo.sysobjects where id
www.eeworm.com/read/405817/11456344
cpp gopher ii(二分匹配).cpp
#include
#include
#include
#include
using namespace std;
#define NMAX 110
int n,m,s,v;
struct node {
double x,y;
}go[NMAX], hole[NMAX];
bool path[NMA
www.eeworm.com/read/405817/11456380
cpp place the robots(二分匹配).cpp
#include
#include
#include
#include
#include
using namespace std;
const int NMAX = 3100;
const int MMAX = 60;
int match[NMAX];
bool flag
www.eeworm.com/read/403717/11512751
txt 一般图匹配(邻接表形式).txt
//一般图最大匹配,邻接表形式,复杂度O(n*e)
//返回匹配顶点对数,match返回匹配,未匹配顶点match值为-1
//传入图的顶点数n和邻接表list
#define MAXN 100
struct edge_t{
int from,to;
edge_t* next;
};
int aug(int n,edge_t* list[],int* match,int*