代码搜索：模版匹配
找到约 3,092 项符合「模版匹配」的源代码
代码结果 3,092
www.eeworm.com/read/457804/7317661
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/457804/7317663
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/440787/7681304
pdf mf rc500电路匹配与设计.pdf
www.eeworm.com/read/297726/8000426
pdf 基于多尺度的轮廓匹配方法.pdf
www.eeworm.com/read/197077/8032159
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/197077/8032173
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/197077/8032177
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/397190/8063459
txt vhdl实现dmf匹配滤波器.txt
library ieee;
use ieee.std_logic_1164.all;
use ieee.numeric_std.all;
entity mf_parallel_tap is
generic(
iInDataWidth : integer :=8;
iOutDataWidth : integer :=16;
iOverSampleRate: integer :
www.eeworm.com/read/316570/13520728
pdf 匹配滤波器的多相实现.pdf
www.eeworm.com/read/316564/13520734