搜索资源列表
improved_all_max_match
- 一种改进的匈牙利匹配算法，可以进行婚姻匹配。-An improved matching algorithm in Hungary.
marriage--matching-problem
- 婚姻匹配问题，几组男子女子，根据各自心仪异性进行婚姻匹配，输入各自名字及心中根据优先级的心仪对象排列，便可组成组合-Marriage matching problem, several groups of men, women, sex for marriage according to their favorite matches, enter their name and the hearts of their favorite choice according to priority or
hunynpipei
- 婚姻匹配算法研究，提供C++代码，主要实现代码，利用矩阵来分析-Marriage matching algorithm, provides C++ code, the main code, the use of matrix analysis
GS
- GS算法解决婚姻稳定匹配问题，也可以作为舞会舞伴安排的算法使用-GS algorithm
MarryMatch
- 2013中兴捧月-数字婚姻配对：采用vs2008编写，能够实现多种模式匹配-2013 ZTE holding on- Digital marriage pairing: the use vs2008 to write, can achieve a variety of pattern matching
PAIR
- 婚姻匹配器 读取TXT文件 通过算法找出每个男士的最佳匹配女士-Marriage matcher read TXT files via algorithm to find the best match for each men' s lady
Gale-Shapley
- 经典婚姻匹配算法，有源码和数据，能直接运行。-Classic marriage matching algorithm, source code and data that can be run directly.
MarriageMatchModel2
- 中兴捧月程序编写大赛——数字婚姻匹配算法实现-ZTE holding monthly programming contest- Digital marriage matching algorithm
stable_matching
- gale-shapley算法的c++实现，用于稳定婚姻匹配，入学匹配，器官匹配等等问题-gale-shapley algorithm c++ implementation for stable marriage matching, enrollment matching, organ matching and so on
stable-marrige-problem
- 婚姻匹配问题模型，同样可以用到市场匹配问题-a model of marrige matching, can also be used to solve market matching problem
sgu264
- sgu264：Travel(稳定婚姻问题) 题目大意： 有n个男人和n个女人，每个男人都在心中有对n个女人的喜欢程度，每个女人亦然。求出一种完备匹配的方案使得任意一对男女(除去匹配的n对)，满足这对男女之间的喜欢程度不都大于喜欢自己配对对象的程度。-264. Travel time limit per test: 1 sec. memory limit per test: 65536 KB input: standard output: standard
Gale-Shapley
- 稳定匹配问题是算法理论中的典型问题之一,稳定婚姻匹配问题则是一种解决二部图匹配问题的模型。对稳定婚姻匹配问题进行了简单的阐述,并介绍了求解典型稳定婚姻问题的Gale-Shapley算法-Stable marriage matching problem is a model to solve the problem of the two graph matching. The problem of stable marriage matching is described briefly, and
taskA
- 稳定婚姻匹配算法,实现了单身男女的快速婚姻匹配-wending huiyin pipei
Match111
- 稳定婚姻匹配：有N男N女，每个人都按照他对异性的喜欢程度排名。现在需要写出一个算法安排这N个男的、N个女的结婚，要求两个人的婚姻应该是稳定的。-Stable marriage matching: there are N M N M, everyone according to his degree of love for the opposite sex rankings. Now you need to write an algorithm to arrange a male N, N-wom
c1
- 算法设计课程设计，稳定婚姻匹配问题，源代码+ppt(Algorithm design curriculum design, stable marriage matching problem, the source code +ppt)
X
- 求解婚姻匹配模型时会遇到两匹配矩阵不为相等人数的情况，本程序可改善该点。利用匈牙利算法求解满足整体最优匹配的结果。(When solving a marriage matching model, it is possible to improve the point when the two matching matrix is not equal to the number of people. The Hungarian algorithm is used to solve the whol
_中兴捧月_初赛
- 简单的数字化婚姻匹配系统。本“数字化婚姻配对系统”必须和配置文件players.txt、male.txt和female.txt放在同一目录下，首次运行后会产生一个result.txt文件，用于保存主角匹配记录，记录可在软件中进行清除(Simple Marriage matching system)