Code Directory
 Visual Basic & VB.NET
New Code
Spire.PDF for Java 2.7.8
Database Workbench Pro
The C# PDF Library 2020.1.5
dotConnect for SQLite 5.15
LuaStudio 9.92
EntityDAC 2.3
Devart ODBC Driver for QuickBooks 2.0
phpEnter 5.1.
Udemy Clone script 2.01
VisualNEO Web 19.11.7
VisualNEO for Windows
SentiVeillance SDK Trial 7.3
Devart ODBC Driver for PostgreSQL 3.2
SecureBridge 9.2
Top Code
SecureBridge 8.0
dotConnect for SQLite 5.9
Database Workbench Pro
EntityDAC 1.6
ATN Site Builder 3.0
ATN Resume Finder 2.0
PHP Review Script 1.0
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
The C# PDF Library 1.0
Active Dhtml Drop Down Menu In Java Script 2.I
A beginner's guide to threading in C#
Ping Pong Game Code Script 1.1
Creating and Using Custom Attributes in C#
Py Tic Tac Toe
Top Rated
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
bghungar 1.0
File ID: 79353

bghungar 1.0
Download bghungar 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 30
Submit Rating:
bghungar 1.0 Description
Description: "Hungarian algorithm" to solve the square assignment problem (original & pure MATLAB implementation). The Hungarian algorithm can also be used as a sub-solver in a B&B solver for the travelling salesman problem.

How to match N (e.g. N=6) pairs of signals from 2 experiments? Build full reordering lists based on the PERMS(1:N) MATLAB function? But the complexity of this approach would be N! = prod(1:6) = 720 for a single run! That of the Hungarian algorithm is just N^3 = 6^3 = 216
i.e. it is many times more efficient!

This code is similar in purpose to the central part of assignprob: hungarian.m, v1.0 96-06-14, adapted by Niclas Borlin,
Unlike latter code which is an adaptation from a 1980 ACM algorithm in Fortran IV, this is original code written directly according to [1], and specially for MATLAB (and very portable across different R's of MATLAB). It has only few, hence efficient lines.

dlT¬ help bghungar

BGHUNGAR "Hungarian algorithm" to solve the square assignment problem

C = a square profit/cost matrix.

the call:
[izSol, ifail, D] = bghungar(C);


izSol = the optimal assignment: MAXIMIZES total profit

ifail = 0: success;
> 0: various failure triggers, according to the algorithm's sub-section

D = the square matrix equivalent to C at the end of iteration [1]

*** Notes:
1) For assignments that MINIMIZE cost, just invert
the sign of the cost matrix:
... = bghungar(-C);

2) Coding decisions are annotated, and debugging commands are provided
(just remove the comments) to resolve intricate use cases.

License: Freeware

Related: Adaptation, across different, adapted, Algorithm, acm algorithm, according to, Notes, 63 3d, 720 for, algorithm subsection, Approach, annotated, provided, assignment maximizes, and very, specially

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 30

User Review for bghungar
- required fields

Please enter text on the image