aboutsummaryrefslogtreecommitdiff
path: root/ports/hungarian/CONTROL
diff options
context:
space:
mode:
authorStefano Sinigardi <stesinigardi@hotmail.com>2019-03-28 22:36:44 +0100
committerPhil Christensen <philc@microsoft.com>2019-03-28 14:36:44 -0700
commitf59ebe91029fa50eff3b1801a13f82e37f95bed2 (patch)
tree8b7889f0fb83358655df44a4ecf4be157dfcedcc /ports/hungarian/CONTROL
parent3c4411b846536fd470613ba8ad4479f0efae5792 (diff)
downloadvcpkg-f59ebe91029fa50eff3b1801a13f82e37f95bed2.tar.gz
vcpkg-f59ebe91029fa50eff3b1801a13f82e37f95bed2.zip
[libhungarian] add port (#5849)
* [libhungarian] add port * [hungarian] fix cmake targets
Diffstat (limited to 'ports/hungarian/CONTROL')
-rw-r--r--ports/hungarian/CONTROL3
1 files changed, 3 insertions, 0 deletions
diff --git a/ports/hungarian/CONTROL b/ports/hungarian/CONTROL
new file mode 100644
index 000000000..96dd5f799
--- /dev/null
+++ b/ports/hungarian/CONTROL
@@ -0,0 +1,3 @@
+Source: hungarian
+Version: v0.1.3
+Description: C-implementation of the Hungarian Method: finding the optimal assignment (assigning a set of jobs to a set of machines) in O(n^3), where n=max{#jobs, #machines}. The implementation is a sligntly enhanced version of the implementation provided by the Stanford GraphBase