Function test_Exp_OP_MUL_Transpose

tests/unit/test_algebraic_expression.c:748–800

}

void test_Exp_OP_MUL_Transpose() {
	// Exp = Transpose(A) * A
	GrB_Matrix B;
	RG_Matrix res;

	/* We must use matrices that we've added to the graph, or else
	 * the transpose optimization will erroneously use the adjacency matrix
	 * (since there is no schema associated with the operands).

	 * The 'visit' matrix represented by V has the form:
	 * 0 0 1 1
	 * 0 0 1 0
	 * 0 0 0 0
	 * 0 0 0 0
	 *
	 * Its transpose, TV, has the form:
	 * 0 0 0 0
	 * 0 0 0 0
	 * 1 1 0 0
	 * 1 0 0 0
	 *
	 * The expected result of the multiplication is:
	 * 1 1 0 0
	 * 1 1 0 0
	 * 1 0 0 0
	 * 1 0 0 0
	 */
	GraphContext *gc = QueryCtx_GetGraphCtx();
	Graph *g = gc->g;
	GrB_Index n = Graph_RequiredMatrixDim(g);

	GrB_Matrix_new(&B, GrB_BOOL, n, n);
	GrB_Matrix_setElement_BOOL(B, true, 0, 0);
	GrB_Matrix_setElement_BOOL(B, true, 0, 1);
	GrB_Matrix_setElement_BOOL(B, true, 1, 0);
	GrB_Matrix_setElement_BOOL(B, true, 1, 1);

	// Matrix used for intermidate computations of AlgebraicExpression_Eval
	// but also contains the result of expression evaluation.
	RG_Matrix_new(&res, GrB_BOOL, n, n);

	// Transpose(A) * A
	AlgebraicExpression *exp = AlgebraicExpression_FromString("V*tV", _matrices);
	AlgebraicExpression_Eval(exp, res);

	// Using the A matrix described above,
	// Transpose(A) * A = B.
	TEST_ASSERT(_compare_matrices(B, res));

	GrB_Matrix_free(&B);
	RG_Matrix_free(&res);
	AlgebraicExpression_Free(exp);
}

void test_Exp_OP_A_MUL_B_Plus_C() {