MPCount/ReducedGraph.cpp at main · ComplexNetworks-DCC-FCUP/MPCount · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
/*
8888ba.88ba   888888ba      a88888b.                              dP
88  `8b  `8b  88    `8b    d8'   `88                              88
88   88   88 a88aaaa8P'    88        .d8888b. dP    dP 88d888b. d8888P
88   88   88  88           88        88'  `88 88    88 88'  `88   88
88   88   88  88           Y8.   .88 88.  .88 88.  .88 88    88   88
dP   dP   dP  dP            Y88888P' `88888P' `88888P' dP    dP   dP


MPCount

Pedro M P Ribeiro - pribeiro@fc.up.pt
Andre Couto Meira - andre.meira@fc.up.pt

*/
/*
 * Graph reduction methods used to transform subgraph during computation.
 *
 * Last Update: 02/2026
 *
 */

#include "ReducedGraph.h"

ReducedGraph::ReducedGraph() { _supra = NULL; }

ReducedGraph::~ReducedGraph() {
  int i;
  if (_supra != NULL) {
    for (i = 0; i < _size; i++)
      if (_supra[i] != NULL)
        delete[] _supra[i];
    delete[] _supra;
  }
}

void ReducedGraph::createSupra(int nodes, int layers, int size) {
  int i;

  _num_layers = layers;
  _num_nodes = nodes;
  _size = size;

  _supra = new bool *[_size];
  for (i = 0; i < size; i++) {
    _supra[i] = new bool[_size];
  }
}

void ReducedGraph::makeSupraEsu(MultiplexGraph *mg, int *v, int permutation) {
  int i, j, k, l;

  _zeroSupra();
  static bool ***adjM = mg->adjacencyMatrices();
  static int num_def_layers = mg->numDefLayers();
  static int *layers = mg->defLayers();

  for (k = 0; k < _num_layers; k++) {
    if (num_def_layers)
      l = layers[k];
    else
      l = k;
    for (i = 0; i < _num_nodes; i++) {
      for (j = 0; j < _num_nodes; j++) {
        if (adjM[v[i]][v[j]][l])
          _supra[i + k * _num_nodes][j + k * _num_nodes] = true;
      }
    }
  }

  _superNodes(permutation);
}

void ReducedGraph::makeSupraFase(char *s, int nodes, int layers,
                                 int permutation) {
  int i, j, k, a, b, l;
  int aux = 0;
  _zeroSupra();

  for (i = 0; i < nodes; i++) {
    k = (i + 1) * layers;
    for (j = 0; j < k * 2; j++) {
      if (s[aux++] == '1') {
        a = i;
        b = j % (i + 1);
        if (j < k)
          l = ((j + 1) / (i + 1));
        else
          l = ((j - k + 1) / (i + 1));
        l = l * nodes;

        if (j < k)
          _supra[a + l][b + l] = true;
        else
          _supra[b + l][a + l] = true;
      }
    }
  }

  _superNodes(permutation);
}

void ReducedGraph::_zeroSupra() {
  int i, j;

  for (i = 0; i < _size; i++) {
    for (j = 0; j < _size; j++) {
      _supra[i][j] = false;
    }
  }
}

void ReducedGraph::_superNodes(int permutation) {
  int i, k;

  for (k = 0; k < _num_layers; k++) {
    for (i = 0; i < _num_nodes; i++) {
      // super nodes for nodes
      _supra[i + k * _num_nodes][i + _num_layers * _num_nodes] = true;
      if (permutation == 2) // super nodes for layers
        _supra[i + k * _num_nodes][k + (_num_layers + 1) * _num_nodes] = true;
    }
  }
  // super nodes for nodes
  for (k = 0; k < _num_layers; k++) {
    for (i = 0; i < _num_nodes; i++) {
      _supra[i + _num_layers * _num_nodes][i + k * _num_nodes] = true;
    }
  }
  // super nodes for layers
  if (permutation == 2) {
    for (k = 0; k < _num_layers; k++) {
      for (i = 0; i < _num_nodes; i++) {
        _supra[k + (_num_layers + 1) * _num_nodes][i + k * _num_nodes] = true;
      }
    }
  }
}