package uk.ac.cam.cl.tester.Algorithms; // Do not modify this line!

public interface Matcher {

    /**
     * Compute a matching, given weights in a bipartite graph.
     * @param weights matrix of edge weights: weights[i][j] is the weight associated
     *                with the edge from left vertex i to right vertex j,
     *                and weight 0 means there is no edge. Note that this
     *                matrix might not be square.  Observe weights.length is the number
     *                of left-vertices, and weights[0].length the number of right-vertices.
     */
    int[] getMatching(int[][] weights);
}