each interaction as long
%   as the modularity value @Q_b@ continues to increase, at which time the heuristic 
%   perform a bisection method between the last values @N@ that were visited.
% * |LPBrim|: The algorithm is a combination between the BRIM and
%   LP algorithms. The heuristic of this algorithm consists in searching for the
%   best module configuration by first using the LP algorithm. The BRIM algorithm
%   is used at the end to refine the results.
% * |LeadingEigenvector|: Although this a