for (unsigned int k1 = 0; k1 < graph[i][j].size(); k1++) {
for (unsigned int k2 = k1; k2 < graph[i][j].size(); k2++) {
std::cout.width(30);
+ std::cout << std::setw(10) << (frame[j][k1] - frame[j][k2] - graph[i][j][k1][k2].radius).norm() << " " <<
+ static_cast< float >(eps) << " "
+ << ((frame[j][k1] - frame[j][k2] - graph[i][j][k1][k2].radius).norm() <= static_cast< float >(eps)) << std::endl;
if ((frame[j][k1] - frame[j][k2] - graph[i][j][k1][k2].radius).norm() <= static_cast< float >(eps)) {
- std::cout << std::setw(10) << (frame[j][k1] - frame[j][k2] - graph[i][j][k1][k2].radius).norm() << " " <<
- static_cast< float >(eps) << " "
- << ((frame[j][k1] - frame[j][k2] - graph[i][j][k1][k2].radius).norm() <= static_cast< float >(eps)) << std::endl;
if (k1 == k2) {
graph[i][j][k1][k2].num++;
} else {