代码搜索：MATCHING
找到约 3,451 项符合「MATCHING」的源代码
代码结果 3,451
www.eeworm.com/read/293393/8295987
rc2 easy pattern matching.rc2
//
// EASY PATTERN MATCHING.RC2 - resources Microsoft Visual C++ does not edit directly
//
#ifdef APSTUDIO_INVOKED
#error this file is not editable by Microsoft Visual C++
#endif //APSTUDIO_IN
www.eeworm.com/read/170917/9779715
pdf algorithm on maximal matching of strings.pdf
www.eeworm.com/read/415311/11077125
m boyer_moore_string_matching.m
function sh = Boyer_Moore_String_Matching(text, x)
% Boyer-Moore string matching: Find the location of the string x in text 'text'
%
% Inputs:
% text - Text vector
% x - Search string
%
www.eeworm.com/read/449369/7507798
todo,v
head 1.6;
access;
symbols
zero-five-zero:1.6
zero-four-seventeen:1.6
zero-four-ten:1.5
zero-four-nine:1.3
zero-four-eight:1.3
zero-four-five:1.2
zero-four-three:1.1
zero-four-zero:1.1;
locks
www.eeworm.com/read/170409/9807708
pdf ch16 pattern matching.pdf
www.eeworm.com/read/360796/10078457
pdf ch16 pattern matching.pdf
www.eeworm.com/read/353600/10436086
html glib-glob-style-pattern-matching.html
Glob-style pattern matching
www.eeworm.com/read/467592/7005667
ppt rabin_karp_matching outline.ppt
www.eeworm.com/read/445660/7592212
cpp two sub-matching template.cpp
//匈牙利算法实现
int Bipartite(bool vc [][MAX],int nv1,int nv2) {
//vc[][]为二分图，nv1,nv2分别为左边的点数
int i, j, x, n;
//n为最大匹配数
int q[MAX], prev[MAX], qs, qe;
//q是BFS用的队列，prev是用来记录交错
www.eeworm.com/read/444286/7614572