搜索资源列表
GS
- GS算法解决婚姻稳定匹配问题，也可以作为舞会舞伴安排的算法使用-GS algorithm
stable_matching
- gale-shapley算法的c++实现，用于稳定婚姻匹配，入学匹配，器官匹配等等问题-gale-shapley algorithm c++ implementation for stable marriage matching, enrollment matching, organ matching and so on
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)