public class AssignmentProblem
extends java.lang.Object
Compilation: javac AssignmentProblem.java
Execution: java AssignmentProblem N
Dependencies: DijkstraSP.java DirectedEdge.java
Solve an N-by-N assignment problem in N^3 log N time using the
successive shortest path algorithm.
Remark: could use dense version of Dijsktra's algorithm for
improved theoretical efficiency of N^3, but it doesn't seem to
help in practice.
Assumes N-by-N cost matrix is nonnegative.