jgirald / modularitygraphs Goto Github PK

Modularity-based Graph Generator.
Version 0.0
Authors:
  - Jesús Giráldez-Cru (UGR)

Based on: Jesús Giráldez-Cru, Jordi Levy: Generating SAT Instances with Community Structure. Artificial Intelligence 238: 119-134 (2016).

Contact: [email protected]

    Copyright (C) 2019 J. Giráldez-Cru, J. Levy

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
===============================

Compile:
--------
$ make

Execute:
--------
$ ./modularityGraphs [-n <nodes>] [-m <edges>] [-c <communities>] [-Q <modularity>] [-s <seed>]

## Default values:
## nodes = 1000
## edges = 4000;
## communities = 10;
## modularity = 0.8;
## seed = 0;

## Restrictions in the parameter values:+
## 1. c must be greater than 1
## 2. Q must be in the interval (0,1)