maximum_bipartite_matching.m

% MAXIMUM_BIPARTITE_MATCHING
% Maximum bipartite matching
%
% matchSet = maximum_bipartite_matching(edgeSet, 'key', value, ...)
%
% where
%
% EDGESET is a (2 x n) integer array, where the i:th column denotes 
% an edge between the left-vertex edgeSet(1, i) and the right-vertex
% edgeSet(2, i). It encodes a bipartite graph G; the left-vertices and
% right-vertices are always disjoint (even if they have the same
% integer ids).
%
% MATCHSET is a (2 x m) integer array, which is a subarray of EDGESET
% such that it forms a maximum bipartite matching in G. That is, each
% vertex is covered by at most one edge, and there is included a 
% maximum amount of edges from G subject to this constraint.
%
% Optional input arguments in 'key'-value pairs:
%
% MODE ('mode') is a string which specifies the search mode:
%     maximal: maximal matching (approximate maximum matching)
%     maximum: maximum matching (default)

% Description: Maximum bipartite matching
% Documentation: matching.txt

function matchSet = maximum_bipartite_matching(edgeSet, varargin)

eval(import_pastel);

if size(edgeSet, 1) ~= 2
    error('The height of EDGESET must be 2.');
end

% Optional input arguments
mode = 'maximum';
eval(process_options({'mode'}, ...
    varargin));

matchSet = pastelsysmatlab('maximum_bipartite_matching', edgeSet, mode);