rtite matrix representing a link (1) or no link (0) between nodes @i@ and @j@, @g_i@ and @h_i@ are the module indexes of nodes @i@ (that 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. <tt>BiMat</tt> contains three algorithms to maximize the last equation, all of them containing different heuristics.</p><div><ul><li><tt>AdaptiveBrim</tt>: The algorithm uses the BRIM algorithm   with an heur