| 62 | // ---------------------------------------------------------------------------------------- |
| 63 | |
| 64 | void make_modularity_matrices ( |
| 65 | const std::vector<sample_pair>& edges, |
| 66 | matrix<double>& A, |
| 67 | matrix<double>& P, |
| 68 | double& m |
| 69 | ) |
| 70 | { |
| 71 | const unsigned long num_nodes = max_index_plus_one(edges); |
| 72 | A.set_size(num_nodes, num_nodes); |
| 73 | P.set_size(num_nodes, num_nodes); |
| 74 | A = 0; |
| 75 | P = 0; |
| 76 | std::vector<double> k(num_nodes,0); |
| 77 | |
| 78 | for (unsigned long i = 0; i < edges.size(); ++i) |
| 79 | { |
| 80 | const unsigned long n1 = edges[i].index1(); |
| 81 | const unsigned long n2 = edges[i].index2(); |
| 82 | k[n1] += edges[i].distance(); |
| 83 | if (n1 != n2) |
| 84 | { |
| 85 | k[n2] += edges[i].distance(); |
| 86 | A(n2,n1) += edges[i].distance(); |
| 87 | } |
| 88 | |
| 89 | A(n1,n2) += edges[i].distance(); |
| 90 | } |
| 91 | |
| 92 | m = sum(A)/2; |
| 93 | |
| 94 | for (long r = 0; r < P.nr(); ++r) |
| 95 | { |
| 96 | for (long c = 0; c < P.nc(); ++c) |
| 97 | { |
| 98 | P(r,c) = k[r]*k[c]/(2*m); |
| 99 | } |
| 100 | } |
| 101 | |
| 102 | } |
| 103 | |
| 104 | double compute_modularity_simple ( |
| 105 | const std::vector<sample_pair>& edges, |
no test coverage detected