equal
deleted
inserted
replaced
88 // number of the nodes of the graph. The inverse map gives back the |
88 // number of the nodes of the graph. The inverse map gives back the |
89 // the node by its descriptor value. |
89 // the node by its descriptor value. |
90 // |
90 // |
91 // The inversemap cannot works without its DescriptorMap because |
91 // The inversemap cannot works without its DescriptorMap because |
92 // it holds reference to it. |
92 // it holds reference to it. |
93 const int EDGE = (int)(NODE * std::log(NODE)); |
93 const int EDGE = (int)(NODE * std::log(double(NODE))); |
94 for (int i = 0; i < EDGE; ++i) { |
94 for (int i = 0; i < EDGE; ++i) { |
95 int si = (int)(std::rand() / (RAND_MAX + 1.0) * NODE); |
95 int si = (int)(std::rand() / (RAND_MAX + 1.0) * NODE); |
96 int ti = (int)(std::rand() / (RAND_MAX + 1.0) * NODE); |
96 int ti = (int)(std::rand() / (RAND_MAX + 1.0) * NODE); |
97 |
97 |
98 graph.addEdge(nodeInv[si], nodeInv[ti]); |
98 graph.addEdge(nodeInv[si], nodeInv[ti]); |