Description: 这是一个叫“文学研究助手”的关于数据结构中串的模式匹配应用的算法，是文学研究人员用于统计英文小说中某些词出现次数与位置的小程序，但由于本人才疏学浅，程序并不完善。-This is called a "literary research assistant" on the data structure of the string pattern matching algorithm for the application, Literature is for statistical researchers English novels appeared certain number and location of small procedures, However, since I have little talent and less learning, the process is not perfect. Platform: |
Size: 4129 |
Author:舒亚 |
Hits:
Description: implementation of Edmonds algorithm for computing a minimum cost perfect matching in a graph
Version 1.0 Platform: |
Size: 43789 |
Author:zhangqian |
Hits:
Description: 这是一个叫“文学研究助手”的关于数据结构中串的模式匹配应用的算法，是文学研究人员用于统计英文小说中某些词出现次数与位置的小程序，但由于本人才疏学浅，程序并不完善。-This is called a "literary research assistant" on the data structure of the string pattern matching algorithm for the application, Literature is for statistical researchers English novels appeared certain number and location of small procedures, However, since I have little talent and less learning, the process is not perfect. Platform: |
Size: 4096 |
Author: |
Hits:
Description: 书籍《C++完美演泽程序》的原版配套代码。-Books C++ Perfect speech Ze procedure matching the original code. Platform: |
Size: 121856 |
Author:wang petter |
Hits:
Description: implementation of Edmonds algorithm for computing a minimum cost perfect matching in a graph
Version 1.0 Platform: |
Size: 44032 |
Author:zhangqian |
Hits:
Description: 本代码执行Edmonds algorithm来进行最小代价函数，实现图形最佳匹配。参考文献："Blossom V: A new implementation of a minimum cost perfect matching algorithm."Vladimir Kolmogorov.
-Edmonds algorithm the implementation of the code for the smallest cost function to achieve the best matching graphics. References: Platform: |
Size: 56320 |
Author:Zhongren Wang |
Hits:
Description: 三国鼎立,杀气飞扬的古代战争色彩,与传奇版本完美搭配，配套游戏图片,游戏装备与介绍，是你开此版本的首选
-Separation of the three countries, murderous war in ancient dusty colors, the perfect match with the legendary version, picture matching games, games equipment and introduction, is that you open this version of the preferred Platform: |
Size: 2382848 |
Author:王琪 |
Hits:
Description: C语言里面的经典算法，包括有老掉牙
河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
Eratosthenes筛选求质数
超长整数运算（大数运算）
长 PI
最大公因数、最小公倍数、因式分解
完美数
阿姆斯壮数
最大访客数
中序式转后序式（前序式）
后序式的运算
关于赌博
洗扑克牌（乱数排列）
Craps赌博游戏
约瑟夫问题（Josephus Problem）
集合问题
排列组合
格雷码（Gray Code）
产生可能的集合
m元素集合的n个元素子集
数字拆解
排序
得分排行
选择、插入、气泡排序
Shell 排序法 - 改良的插入排序
Shaker 排序法 - 改良的气泡排序
Heap 排序法 - 改良的选择排序
快速排序法（一）
快速排序法（二）
快速排序法（三）
合并排序法
基数排序法
搜寻
循序搜寻法（使用卫兵）
二分搜寻法（搜寻原则的代表）
插补搜寻法
费氏搜寻法
矩阵
稀疏矩阵
多维矩阵转一维矩阵
上三角、下三角、对称矩阵
奇数魔方阵
4N 魔方阵
2(2N+1) 魔方阵
-Obsolete
Hanoi Tower
Fei-style series
Pascal triangle
Three-color Chess
Mouse walking fans Officer (1)
Mouse walking fans Officer (2)
Knight walking board
8 Queens
8 coins
Game of Life
String matching
Two-color, three-color Hanoi Tower
Knapsack problem (Knapsack Problem)
The number of operations
Monte Carlo method seeking PI
Eratosthenes prime number screened seeking
Long integer arithmetic (operations of large numbers)
Long PI
Greatest common factor, least common multiple, factorization
Perfect Number
阿姆斯壮数
Maximum number of visitors
Type in order to switch the order of type (pre-order type)
Follow-style computing
About Gambling
Wash cards (random order)
Craps Casino Games
Joseph problems (Josephus Problem)
Set problem
Permutations
Gray code (Gray Code)
Generate the set of possible
m elements of the collection a subset of n elements
Digital dismantling
Sort
Score Ranking
Selection, insertion, bubble sort
Shell Platform: |
Size: 441344 |
Author:neoleo |
Hits:
Description: 基于文献“一种新的最小割完美匹配算法”的最小割匹配算法-An implementation of a minimum cost perfect matching algorithm described in
Blossom V: A new implementation of a minimum cost perfect matching algorithm.
Vladimir Kolmogorov.
To appear in Mathematical Programming Computation (MPC). Platform: |
Size: 46080 |
Author:illusionme |
Hits:
Description: 图像密集匹配经典算法（图割）代码
论文“Blossom V: A new implementation of a minimum cost perfect matching algorithm.”的实现源码-BLOSSOM V- implementation of Edmonds algorithm for computing a minimum cost perfect matching in a graph
Version 2.02 Platform: |
Size: 60416 |
Author:zhang |
Hits:
Description: Kuhn-Munkers算法的几种变形应用
1.Kuhn-Munkers算法是求最大权完备匹配，如果要求最小权完备匹配怎么办？方法很简单，只需将所有的边权值取其相反数，求最大权完备匹配，匹配的值再取相反数即可。
2.Kuhn-Munkers算法的运行要求是必须存在一个完备匹配，如果求一个最大权匹配(不一定完备)该如何办？依然很简单，把不存在的边权值赋为0。
3.Kuhn-Munkers算法求得的最大权匹配是边权值和最大，如果我想要边权之积最大，又怎样转化？还是不难办到，每条边权取自然对数，然后求最大和权匹配，求得的结果a再算出e^a就是最大积匹配。
-Several variations of the application Kuhn-Munkers algorithm
1.Kuhn-Munkers algorithm is seeking maximum weight perfect matching, if the requirements of the minimum weight perfect matching how to do? The method is very simple, just all weights whichever side opposite number, the right to seek the most complete, the matching values can then take the opposite number.
Operational requirements 2.Kuhn-Munkers algorithm is there must be a complete match, if seeking a maximum weight matching (not necessarily complete) how to do? Is still very simple, the edge weights assigned a value that does not exist is 0.
3.Kuhn-Munkers maximum weight matching algorithm is obtained and the maximum value of edge weights, if I want to plot the right side of the largest, but also how to transform? Is not difficult, each side the right to take the natural logarithm, and then find the maximum and the right to match the results of a re-calculated to obtain e ^ a product is the greatest match.
Platform: |
Size: 1024 |
Author:蓝星超 |
Hits:
Description: 二分图最佳匹配算法是通过给每个顶点一个标号来把求最大权匹配的问题转化为求完备匹配的问题的-Bipartite graph matching algorithm is optimal for each vertex by a reference to the right to seek the maximum matching problem and minimize the perfect matching problem Platform: |
Size: 1024 |
Author:刘金鑫 |
Hits:
Description: 只为使用的部分付费，轻松可靠地进行缩放，将使用量与实际需求完美匹配，满足突发或峰值需求，而不用支付加急编码单位的费用，并可降低前期和当前 IT 支出。
简化的视频内容管理
使用我们简单易用的管理解决方案轻松存储、编码和管理您的媒体服务视频内容。(Only for the use of pay part, easily and reliably zoom, usage and actual demand of perfect matching, or meet the sudden peak demand, without having to pay the cost of expedited encoding unit, and can reduce the previous and current expenditure IT.
Simplified video content management
Use our easy-to-use management solutions to store, encode, and manage your media services video content easily.) Platform: |
Size: 2048 |
Author:qqxunle
|
Hits:
Description: Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw Tian's horses on one side, and the king's horses on the other. Whenever one of Tian's horses can beat one from the king, we draw an edge between them, meaning we wish to establish this pair. Then, the problem of winning as many rounds as possible is just to find the maximum matching in this graph. If there are ties, the problem becomes more complicated, he needs to assign weights 0, 1, or -1 to all the possible edges, and find a maximum weighted perfect matching...(For each input case, output a line containing a single number, which is the maximum money Tian Ji will get, in silver dollars.) Platform: |
Size: 1024 |
Author:zilewwy |
Hits:
Search - perfect matching