1. Home
  2. Browse
  3. hungarian

hungarian

vv0.1.3#2Go to latest

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

Install

Run the following Vcpkg command to install the port.

Usage

Usage details are not available for this port.

Dependencies

See source

Version

vv0.1.3#2

Publication

Supports

All

Subtree

5b11232d00

License

Complex license

Definition

Manifest