搜索资源列表
KM
- 二分图最佳匹配算法，使用KM算法的邻接矩阵的实现-Bipartite graph matching algorithm is the best use of KM implementation of the adjacency matrix algorithm
match
- 三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)
Bipartite
- 图论*匈牙利算法 的两种实现过程 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
Hungary
- 匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
20090224171138551
- 主要内容： 匹配的概念 二分图的定义和判定 二分图的最大匹配 二分图的最小覆盖问题 二分图的最佳匹配问题 -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 match
MessageBox
- The preparation of Euler circuit algorithm, bipartite graph of the curriculum design, implementation, use of credit to the path to achieve
Bipartite-graph-to-determine
- 本压缩文件完整地实现了二分图判定的判定算法，代码很完整 -This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
HungaryAlgorithm
- 匈牙利算法，实现求二分图最大匹配，还有一些资料，实现的语言是C-Hungarian algorithm, seeking to achieve the maximum bipartite matching, there are some data to realize the language is C++
Cpp1
- KM算法，很好的用于求二分图的最优匹配问题-KM algorithm, very good for seeking the optimal bipartite graph matching problem
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
hdu3865
- 杭电3865 动态规划 +二分图 解题报告-Hang Power 3865+ bipartite graph dynamic programming problem-solving report
xyl
- 匈牙利算法，实现二分图问题的好途径，自己写的，是用邻接表来实现。-Hungarian algorithm for bipartite graph a good way to write your own adjacency list.
bipartite-graph-algorithms
- 本文初步介绍了二分图有关的基本算法，和常用的建模方法-The paper initially describes the bipartite graph algorithms, and modeling
munkres
- 匈牙利算法matlab实现，对于二部图的最优匹配-Hungarian algorithm matlab achieve optimal matching of bipartite graph
1293xoj
- 这是XOJ1293的代码，主要应用了二分图匹配的dp算法。-The code of XOJ1293 bipartite graph matching algorithm of dp main application.
group_douban
- 对group——user网络计算出group--group网络，边权为group间的overlap-compute a bipartite graph
ten-algorithm
- 目录 1，搜索算法； 2，贪心算法； 3，动态规划； 4，最短路径； 5，最小生成树； 6，二分图的最大匹配； 7，-Contents 1, the search algorithm 2, the greedy algorithm 3, dynamic programming 4, the shortest path 5, the minimum spanning tree 6, maximum bipartite matching 7, ...
Hungary-algorithm-
- 利用增广路径，求二部图的最大匹配的匈牙利算法-The Hungary maximum matching algorithm of Bipartite graph.
main.cpp
- poj1486 代码 二分图匹配问题 寻找必须边 经典模型-poj1486 code bipartite graph matching side must find the classical model
segment-tree
- 在实际应用中，常遇到与区间有关的操作，比如统计若干矩形并集的面积，记录一个区间的最大最小值及总量，并在区间的插入、删除和修改中维护这些数据。线段树的定义是利用树形二分结构所建立的一种数据结构，能够高效的完成这些操作。-In practical applications, often encountered in the interval-related operations, such as statistics and set a number of rectangular area, rec