hat belongs to set
% @R@) and @j@ (that belongs to set @C@), @k_i@ is the degree of node @i@, @d_j@ is
% the degree of node @j@ and @E@ is the number of links in the network.  
% |BiMat| contains three algorithms to maximize the last equation, all of
% them containing different heuristics. 
%
% * |AdaptiveBrim|: The algorithm uses the BRIM algorithm
%   with an heuristic to look for the optimal value of modules. This heuristic consists
%   in multiply the number of modules @N@ by a factor of two at 