Location:
Search - bipartite graph
Search list
Description: 详细介绍了二分图匹配，值得一看。尤其是搞大学生程序设计竞赛的，更值得一看。-Detailed information on bipartite graph matching, worth a visit. In particular, engage in Collegiate Programming Contest, and more worth a visit.
Platform: |
Size: 173056 |
Author: 吴索铸 |
Hits:
Description: 图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read
Platform: |
Size: 1024 |
Author: cdw |
Hits:
Description: 寻找二分图的最大匹配
程序通过一个二维的数组给出二分图，让后找出一个初始的匹配，通过初始匹配
找出最大匹配。
-Bipartite graph to find the maximum matching program through a two-dimensional array is given bipartite graph, so that after the initial find a match, the adoption of the initial match to find the greatest match.
Platform: |
Size: 95232 |
Author: Tina612 |
Hits:
Description: 图论*匈牙利算法 的两种实现过程
Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙
其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,
Platform: |
Size: 3072 |
Author: jiangxr |
Hits:
Description: 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法，希望朋友们多多讨论，争取找一种更好的增广路方法，有想法的一定告诉我，谢谢，jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm description completely according to the use of computing to achieve a collection of matlab code. Here we need to discuss is the way to broaden the selection of the algorithm, a lot of friends who wish to discussions in order to find a better way to broaden the way, there is a certain mind to tell me, thank you, jxrhhu@hhu.edu.cn
Platform: |
Size: 1024 |
Author: jiangxr |
Hits:
Description: 匈牙利算法实现二分图最大匹配
文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
Platform: |
Size: 1024 |
Author: 武永基 |
Hits:
Description: 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
Platform: |
Size: 1024 |
Author: 王琦 |
Hits:
Description: 基于图的二分算法，使用c++编写，执行效率非常高，特别适用于网络划分-Bipartite graph-based algorithm, the use of c++ Preparation, implementation efficiency is very high, especially for network segmentation
Platform: |
Size: 31744 |
Author: 大赛分 |
Hits:
Description: 加权二分图匹配，对于给定权重的二分图求出最大匹配-find the max matching of a given weighted bipartite graph
Platform: |
Size: 1024 |
Author: LS |
Hits:
Description: 判断一个连通无向图是否为二部图
利用两个集合存放两个不相交的子集-Determine whether a connected undirected graph is a bipartite graph
Platform: |
Size: 8192 |
Author: weixiaoguoke |
Hits:
Description: 二分图的最大匹配，非常好的资料。这是我辛勤找来的。-Bipartite graph of maximum matching, very good information. This is what I found the hard.
Platform: |
Size: 8192 |
Author: shixinfei |
Hits:
Description: 这一代码应用最经典的二部图算法，稍加改动便可用于其它类似题目，希望有所帮助-The code of the most classic bipartite graph algorithm can be modified for other similar topic, hope that help
Platform: |
Size: 1024 |
Author: 王强 |
Hits:
Description: 主要内容：
匹配的概念
二分图的定义和判定
二分图的最大匹配
二分图的最小覆盖问题
二分图的最佳匹配问题
-Main elements: the concept of matching the definition of bipartite graph and determine the maximum bipartite graph matching bipartite graph of minimum coverage of bipartite graph matching problem best
Platform: |
Size: 131072 |
Author: 陈子杭 |
Hits:
Description: The preparation of Euler circuit algorithm, bipartite graph of the curriculum design, implementation, use of credit to the path to achieve
Platform: |
Size: 152576 |
Author: 小小 |
Hits:
Description: 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including
1.Hungarian with DFS
2.Hungarian with BFS
3.Hopcroft-Karp algorithm
Platform: |
Size: 2048 |
Author: lj-leech |
Hits:
Description: 本压缩文件完整地实现了二分图判定的判定算法，代码很完整
-This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
Platform: |
Size: 1024 |
Author: 榔头 |
Hits:
Description: 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
Platform: |
Size: 7168 |
Author: 陈帅军 |
Hits:
Description: 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
Platform: |
Size: 21504 |
Author: 陈帅军 |
Hits:
Description: 本文初步介绍了二分图有关的基本算法，和常用的建模方法-The paper initially describes the bipartite graph algorithms, and modeling
Platform: |
Size: 572416 |
Author: 陈融一 |
Hits:
Description: 自己的笔记，二分图匹配详解，是用匈牙利算法解的。-Own notes, bipartite graph matching explain, with the Hungarian algorithm solution.
Platform: |
Size: 463872 |
Author: 吕敏敏 |
Hits: