Function test_QueryGraphClone

tests/unit/test_query_graph.c:166–215

}

void test_QueryGraphClone() {
	// create a triangle graph
	// (A)->(B)->(C)->(A)
	size_t node_cap = 3;
	size_t edge_cap = 3;

	// create nodes
	const char *relation = "R";

	QGNode *A = QGNode_New("A");
	QGNode *B = QGNode_New("B");
	QGNode *C = QGNode_New("C");

	QGEdge *AB = QGEdge_New(relation, "AB");
	QGEdge *BC = QGEdge_New(relation, "BC");
	QGEdge *CA = QGEdge_New(relation, "CA");

	QueryGraph *g = QueryGraph_New(node_cap, edge_cap);
	QueryGraph_AddNode(g, A);
	QueryGraph_AddNode(g, B);
	QueryGraph_AddNode(g, C);

	QueryGraph_ConnectNodes(g, A, B, AB);
	QueryGraph_ConnectNodes(g, B, C, BC);
	QueryGraph_ConnectNodes(g, C, A, CA);

	QueryGraph *clone = QueryGraph_Clone(g);

	// validations
	TEST_ASSERT(QueryGraph_NodeCount(g) == QueryGraph_NodeCount(clone));
	TEST_ASSERT(QueryGraph_EdgeCount(g) == QueryGraph_EdgeCount(clone));

	// validate nodes
	for(int i = 0; i < QueryGraph_NodeCount(g); i++) {
		QGNode *a = g->nodes[i];
		QGNode *b = clone->nodes[i];
		compare_nodes(a, b);
	}

	// validate edges
	for(int i = 0; i < QueryGraph_EdgeCount(g); i++) {
		QGEdge *a = g->edges[i];
		QGEdge *b = clone->edges[i];
		compare_edges(a, b);
	}

	// clean up
	QueryGraph_Free(g);
	QueryGraph_Free(clone);
}


void test_QueryGraphRemoveEntities() {