搜索资源列表
判断一个连通无向图是否为二部图
- 判断一个连通无向图是否为二部图 利用两个集合存放两个不相交的子集,Determine whether a connected undirected graph is a bipartite graph
fm
- 基于图的二分算法，使用c++编写，执行效率非常高，特别适用于网络划分-Bipartite graph-based algorithm, the use of c++ Preparation, implementation efficiency is very high, especially for network segmentation
Matching_on_Weighted_Bipartite_Graph
- 加权二分图匹配，对于给定权重的二分图求出最大匹配-find the max matching of a given weighted bipartite graph
2771
- poj 2771 一道关于二分图的最大匹配-poj 2771 on the maximum bipartite graph matching
1469
- poj 1469 COURSES 二分图的最大匹配问题 -poj 1469 COURSES largest bipartite graph matching problem
erbutu
- 这一代码应用最经典的二部图算法，稍加改动便可用于其它类似题目，希望有所帮助-The code of the most classic bipartite graph algorithm can be modified for other similar topic, hope that help
graphtheory
- 5个关于图论的算法 包括K短路问题 NLOGN问题 二分图匹配问题 费用流问题 最大流问题-5 on the graph theory algorithms, including K shortest path problem NLOGN problems cost bipartite matching maximum flow flow
BipartiteGraphs
- Bipartite Graphs for Graph Teory
hungrian
- 匈牙利算法的源代码，可以解决二分图的最大匹配问题-Hungarian algorithm source code, can solve the maximum matching problem for bipartite graphs
Maximal
- 分图又称作二部图，是图论中的一种特殊模型。 设G=(V,E)是一个无向图，如果顶点V可分割为两个互不相交的子集(A,B)，并且图中的每条边（i，j）所关联的两个顶点i和j分别属于这两个不同的顶点集(i in A,j in B)，则称图G为一个二分图。-Bipartite graph is also called a bipartite graph, graph theory, a special model. Let G = (V, E) is an undirected graph, vert
ACM.algorithm
- 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms templat
Hungarian_algorithm
- 这段代码使用matlab实现匈牙利算法的匹配问题-This algorithm allows you to find the minimum weight matching of a bipartite graph. The graph can be of arbitrary size and connectedness. The edge weights are captured by a MxN weight matrix where an infinite(Inf) weight desi
Bipartite-graph
- 使用matlab编程，讨论二分图的最大匹配和最优匹配-Using matlab programming, discussing the maximum bipartite matching and optimal matching
uva-10349
- 二部图的最大匹配问题，先构建二部图，然后用匈牙利算法求出最大匹配-The maximum bipartite graph matching problem, first build a bipartite graph, and then use the Hungarian algorithm to derive maximum matching
sort
- 二分排序算法，归并排序算法，快速排序算法的简单实现，算法分析-Simple bipartite sorting algorithms, merge sort algorithm, fast sorting algorithm, algorithm analysis
Hopcroft--Karp
- Hopcroft--Karp算法,该算法能求二分图最大匹配-Hopcroft- Karp algorithm that can find the maximum matching bipartite graph
bipartite_network
- 利用泊松分布构建的复杂网络的二分网络演化建模-Poisson distribution building complex networks of Bipartite network evolution model
Desktop
- 在二分图中求最少的点，让每条边都至少和其中的一个点关联，这就是二分图的“最小顶点覆盖”。二分图的最小顶点覆盖数 =二分图的最大匹配数。-In seeking bipartite graph fewest points, so that each edge and at least one associated point, which is the bipartite graph of the minimum vertex cover. Bipartite graph of the mini
acm1083
- 浙江大学的acm1083，一道水题，二分匹配-Zhejiang University acm1083, a water problem, bipartite matching
bipartiteLocalModel
- 二分图的局部模型代码，用于解决二分图问题，及其二分图的链路预测问题(Bipartite map of the local model code, used to solve the bipartite graph problem, and its bipartite graph link prediction problem)