代码搜索：模版匹配
找到约 3,092 项符合「模版匹配」的源代码
代码结果 3,092
www.eeworm.com/read/480604/6666720
pdf 一种快速图像匹配算法的设计与实现.pdf
www.eeworm.com/read/478955/6708639
txt 一般图匹配(邻接表形式,邻接阵接口).txt
//一般图最大匹配,邻接表形式,复杂度O(n*e)
//返回匹配顶点对数,match返回匹配,未匹配顶点match值为-1
//传入图的顶点数n和邻接表list
#include
#define MAXN 100
int aug(int n,vector list[],int* match,int* v,int now){
int t,ret=0,r;
www.eeworm.com/read/405817/11456381
cpp uncle tom's inherited land(二分匹配).cpp
#include
#include
#include
#include
using namespace std;
#define NMAX 110
#define PMAX 60
int n, m, k, p;
struct node {
int x,y;
}point[PMAX];
int
www.eeworm.com/read/405817/11456412
cpp card game cheater(最大二分匹配).cpp
#include
#include
#include
using namespace std;
const int Max = 60;
vector< vector > Bmap;
int n, m, k, nm;
int mark[Max];
bool flag[Max];
struct node {
int s
www.eeworm.com/read/403717/11512752
txt 一般图匹配(邻接表形式,邻接阵接口).txt
//一般图最大匹配,邻接表形式,复杂度O(n*e)
//返回匹配顶点对数,match返回匹配,未匹配顶点match值为-1
//传入图的顶点数n和邻接表list
#include
#define MAXN 100
int aug(int n,vector list[],int* match,int* v,int now){
int t,ret=0,r;
www.eeworm.com/read/400753/11569542
txt 一般图匹配(邻接表形式,邻接阵接口).txt
//一般图最大匹配,邻接表形式,复杂度O(n*e)
//返回匹配顶点对数,match返回匹配,未匹配顶点match值为-1
//传入图的顶点数n和邻接表list
#include
#define MAXN 100
int aug(int n,vector list[],int* match,int* v,int now){
int t,ret=0,r;
www.eeworm.com/read/149174/12397542
doc misc对mo的业务匹配处理流程说明_1217.doc
www.eeworm.com/read/124043/14599090
doc misc对mo的业务匹配处理流程说明_040105.doc
www.eeworm.com/read/211952/15169765
cpp p2333_二分图匹配_最小覆盖集合.cpp
#include
#include
#define MAXN 100
int N , M , Link [MAXN] , Linkback [MAXN], Ans;
bool graph [MAXN] [MAXN] , mky [MAXN] , mkx [MAXN];
void init ();
bo
www.eeworm.com/read/11305/221493