Hungarian Algorithm in C#(blog.noldorin.com)
submitted by 
Noldorin(829) 2 years, 3 months ago
The Hungarian algorithm, also known as the Kuhn-Munkres algorithm, is well-known to be the most efficient algorithm for solving the assignment problem. In fact, it does what is considered by many to an exponential time algorithm (more specifically, factorial time), in O(n^3). This post provides C# 3.0 source code for applying the Hungarian algorithm to any cost matrix.
|category: C#
|Views: 293
tags:
combinatorics C# another
Everyones tags:
Your Tags: