pszufe

Below you will find the companing files for the Clustering via hypergraph modularity submitted to the PLOS ONE journal by Bogumił Kamiński, Valérie Poulin, Paweł Prałat, Przemysław Szufel and François Théberge.

In the paper, a hypergraph modularity function is proposed that generalizes its well established and widely used graph counterpart measure of how clustered a network is.

The provided code files contain implementation of heuristic algorithm

babarot

#!/usr/bin/env perl

use strict;
use warnings;

my $fg = "\x1b[38;5;";
my $bg = "\x1b[48;5;";
my $rs = "\x1b[0m";

my $color = 0;