return 4;
}
-/*
-int main()
+////////////////////////////////////////////////////////////////////////////////
+double distance_cosine(const VectorXd& u, const VectorXd& v)
{
- Matrix3i C;
-// MatrixXi C2(4, 3);
-//
- C << 1, 2, 3,
- 2, 4, 2,
- 3, 6, 9;
-
- Matrix3i M;
- M << 0, 1, 2,
- 0, 0, 0,
- 1, 0, 0;
-
-// C2 << 4, 1, 3,
-// 2, 4, 2,
-// 3, 6, 9,
-// 2, 6, 3;
-
- Vector3i vv;
- //Matrix3i m1 = (M.array() == 1).select(0, MatrixXi::Ones(M.cols(), M.rows()));
- //cout << m1.colwise().sum().transpose() << endl;
- //vv = vv.rowwise()
-
- VectorXi row_ind, col_ind;
+ return (1 - u.dot(v) / std::sqrt(u.dot(u) * v.dot(v)));
+}
- //MatrixXi RR = MatrixXi::Random(10, 10);
- linear_sum_assignment(C, row_ind, col_ind);
- cout << "row: [" << row_ind.transpose() << "], col: [" << col_ind.transpose() << "]" << endl;
+double distance_euclidean(const VectorXd& u, const VectorXd& v)
+{
+ VectorXd d = u - v;
+ return std::sqrt(d.dot(d));
}
-*/