搜索资源列表
GraphTheoryAlgorithmMATLAB
- 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
biMatichHungary
- 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法,希望朋友们多多讨论,争取找一种更好的增广路方法,有想法的一定告诉我,谢谢,jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm descr iption completely according to the use of computing to achieve a collection of matlab code. Her
MCMProjects
- 我备战2010数学建模美赛所精心准备的算法资料,一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现,来解决一个问题。其中一些是自己编写,其它的也是由网上找到后经过修改编译通过的。比赛结果还不错,一个M,现在把资料共享出来,希望对大家有所帮助,算法主要有模拟退火,遗传算法,蒙特卡罗算法,蚁群算法,粒子群算法,元胞自动机,Dijkstra,最小生成树算法,二分图最大匹配算法,最大流算法,动态规划算法,分支定界法,排队论算法,决策论算法等,我写了个说明文件,列的挺详细的-I a
reducing_cycles
- reduces cycles in bipartite graph
zuidapipei
- 使用匈牙利算法实现二部图最大匹配,最终找到二部图的最大匹配-achieve the max matching in bipartite graph useing the method of Hungarian algorithm
Perfect-Match
- 实现一个二分图的完美匹配,找到最终的匹配结果-To achieve a perfect match bipartite graph, find the final matching results
Adjust
- 对于非完全二分图的最优匹配问你,给出了一种调整赋权矩阵的方法来解决-For non-complete bipartite graph optimal matching ask you adjust the empowerment matrix gives a way to solve
graph-coloring
- 基于greedy DSATUR 的经典着色程序-Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However for some specific graph classe
2k-means
- 基于matlab的二分k均值聚类算法,经过仿真实验成功。-Bipartite k-means clustering algorithm based on matlab, after successful simulation.
匈牙利
- 匈牙利算法,用于求解二分图的匈牙利算法,里面包含量两种求解方法,希望对大家有用。(Hungarian algorithm can be used to solve the bipartite matching problem , but it requires the bipartite graph to be completely symmetric. Hence we need to transform the original non-symmetric binary map matchi