Download the PHP
package elgigi/hungarian-algorithm without Composer
On this page you can find all versions of the php package
elgigi/hungarian-algorithm. It is possible to download/install
these versions without Composer. Possible dependencies are resolved
automatically.
Vendor elgigi Package hungarian-algorithm Short Description An implementation of the Hungarian algorithm in PHP. License
MIT
FAQ
After the download, you have to make one include require_once('vendor/autoload.php');. After that you have to import the classes with use statements.
Example:
If you use only one package a project is not needed. But if you use more then one package, without a project it is not possible to import the classes with use statements.
In general, it is recommended to use always a project to download your libraries. In an application normally there is more than one library needed.
Some PHP packages are not free to download and because of that hosted in private repositories.
In this case some credentials are needed to access such packages.
Please use the auth.json textarea to insert credentials, if a package is coming from a private repository.
You can look here for more information.
Some hosting areas are not accessible by a terminal or SSH. Then it is not possible to use Composer.
To use Composer is sometimes complicated. Especially for beginners.
Composer needs much resources. Sometimes they are not available on a simple webspace.
If you are using private repositories you don't need to share your credentials. You can set up everything on our site and then you provide a simple download link to your team member.
Simplify your Composer build process. Use our own command line tool to download the vendor folder as binary. This makes your build process faster and you don't need to expose your credentials for private repositories.
Informations about the package hungarian-algorithm
Hungarian Algorithm
An implementation of the Hungarian algorithm in PHP. The Hungarian algorithm can be used to find the optimal (minimal
cost) assignment between two types of entities given a cost matrix. The Hungarian algorithm is also known as the
Kuhn–Munkres algorithm or Munkres assignment algorithm.
This fork is based on rpfk's implementation.
Addition of original repository is visible on changelog.
Define a square matrix with scores as input for the Hungarian class. A square matrix must be an array consisting of n
arrays (rows), with each array consisting of n scores.
The key of each element in the row array must be equal to the key of the column.
All versions of hungarian-algorithm with dependencies
Composer command for our command line client (download client)This client runs in each environment. You don't need a specific PHP version etc. The first 20 API calls are free.Standard composer command
The package elgigi/hungarian-algorithm contains the following files
Loading the files please wait ....
Loading please wait ...
Before you can download the PHP files, the dependencies should be resolved. This can take some minutes. Please be patient.