搜索资源列表
sbppp_1
- 实现匈牙利算法 实现匈牙利算法 实现匈牙利算法，求最大组合-algorithm to achieve Hungary Hungary algorithm algorithm Hungary is the Hungarian a lgorithm algorithm for the largest portfolio
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
naming-rules
- 主要讲述匈牙利命名规则，编程规范，代码书写规范-About the Hungarian main rules, programming specifications, code written specifications ~ ~ ~ ~
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
AppControls
- Supported Languages: Afrikaans, Albanian, Arabic, Azerbaijani, Basque, Belarusian, Bengali, Bulgarian, Catalan, Cherokee, Chinese (Simplified and Traditional), Croatian, Czech, Danish, Dutch, English, Esperanto, Estonian, Finnish, Frankish, French, G
Hungarian-algorithm
- 忘记在哪下的了，是匈牙利算法。可以非常好的运行，做运筹学课设时可以借鉴。-Hungarian algorithm
Fastreport-2.51-Full-Source
- FastReport supports a significant number of languages. FastReport has several language sets: English, German, French, Danish, Portuguese-brazil, Spanish, Dutch, Swedish, Turkish, Italian, Polish, Czech, Hungarian, Slovene, Catalon,
hungarian-algorithm
- 用匈牙利算法求求解二分图最大匹配的算法思路-An algorithm for finding the maximum matching of two points graph with Hungarian algorithm
圆面积
- 采用匈牙利法则命名，根据半径求出圆面积，半径保留两位小数，面积保留八位小数，适合初学者。(The Hungarian rule is used to calculate the circle area according to the radius. The radius retains two decimal points, and the area retains eight decimal points, which is suitable for beginners.)