Function test_QueryGraphRemoveEntities

tests/unit/test_query_graph.c:218–285

void test_QueryGraphRemoveEntities() {
	// 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);

	// remove an edge
	TEST_ASSERT(contains_edge(g, AB));
	TEST_ASSERT(QueryGraph_GetEdgeByAlias(g, "AB") != NULL);

	QueryGraph_RemoveEdge(g, AB);

	TEST_ASSERT(!contains_edge(g, AB));
	TEST_ASSERT(QueryGraph_GetEdgeByAlias(g, "AB") == NULL);

	// remove node
	TEST_ASSERT(contains_node(g, C));
	TEST_ASSERT(QueryGraph_GetNodeByAlias(g, "C") != NULL);

	QueryGraph_RemoveNode(g, C);

	TEST_ASSERT(!contains_node(g, C));
	TEST_ASSERT(QueryGraph_GetNodeByAlias(g, "C") == NULL);

	// both CA BC edges should be removed
	TEST_ASSERT(!contains_edge(g, CA));
	TEST_ASSERT(QueryGraph_GetEdgeByAlias(g, "CA") == NULL);

	TEST_ASSERT(!contains_edge(g, BC));
	TEST_ASSERT(QueryGraph_GetEdgeByAlias(g, "BC") == NULL);

	// assert entity count:
	// nodes - A was removed
	// edges - AB explicitly removed, BC and CA implicitly removed
	TEST_ASSERT(QueryGraph_NodeCount(g) == 2);
	TEST_ASSERT(QueryGraph_EdgeCount(g) == 0);

	// assert remaining entities