搜索资源列表
匈牙利算法
- 本文用Ｃ语言实现了优化算法－匈牙利算法，以用来解决匹配问题-Using C programming language, the optimization algorithm-Hungary algorithm used to solve the matching problem
zhipaiproblem
- 指派问题（非匈牙利算法），用matlab编的，不是原创-assignment (Hungary algorithm), using Matlab series, not originality
sbppp_1
- 实现匈牙利算法 实现匈牙利算法 实现匈牙利算法，求最大组合-algorithm to achieve Hungary Hungary algorithm algorithm Hungary is the Hungarian a lgorithm algorithm for the largest portfolio
xyl
- 匈牙利算法的实现，比较简单，本人自己写，望大家赐教
fenpei
- 关于匈牙利分配问题的matlab程序,只配问题，匈牙利算法求解-About matlab to the problem of xiong,it s fantanstic ,it can do all the thing you want to do
bipartite_graph_maximum_matching
- 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm
xyl
- 语音处理匈牙利算法的实现，比较简单，望大家赐教-Speech processing algorithm implementation in Hungary, a relatively simple, hope you enlighten me
xyl_suanfa
- 匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。-Hungarian algorithm is based on the thought of the Hall theorem sufficient proof, it is the Ministry of graph matching most common algorithm, the core of the algorithm is to fi
Hungarian-algorithm
- 忘记在哪下的了，是匈牙利算法。可以非常好的运行，做运筹学课设时可以借鉴。-Hungarian algorithm
Warshall
- Warshall算法,BellmanFord,Dijkstra,Kruskal,欧拉路，网络最大流，匈牙利算法，-Warshallprotocol,BellmanFord,Dijkstra,Kruskal and so on
hungarian-algorithm
- 用匈牙利算法求求解二分图最大匹配的算法思路-An algorithm for finding the maximum matching of two points graph with Hungarian algorithm