Function test_removeNodes

tests/unit/test_graph.c:259–324

}

void test_removeNodes() {
	// Construct graph.
	RG_Matrix M;
	GrB_Index nnz;
	Graph *g = Graph_New(32, 32);
	Graph_AcquireWriteLock(g);

	// Create 3 nodes.
	Node node;
	Edge edge;

	for(int i = 0; i < 3; i++) {
		node = GE_NEW_NODE();
		Graph_CreateNode(g, &node, NULL, 0);
	}
	int r = Graph_AddRelationType(g);

	/* Connections:
	 * 0 connected to 1.
	 * 1 connected to 0.
	 * 1 connected to 2. */

	// connect 0 to 1.
	Graph_CreateEdge(g, 0, 1, r, &edge);

	// Connect 1 to 0.
	Graph_CreateEdge(g, 1, 0, r, &edge);

	// Connect 1 to 2.
	Graph_CreateEdge(g, 1, 2, r, &edge);

	// Validate graph creation.
	TEST_ASSERT(Graph_NodeCount(g) == 3);
	M = Graph_GetRelationMatrix(g, r, false);
	RG_Matrix_nvals(&nnz, M);
	TEST_ASSERT(nnz == 3);

	M = Graph_GetAdjacencyMatrix(g, false);
	RG_Matrix_nvals(&nnz, M);
	TEST_ASSERT(nnz == 3);

	Edge *edges = (Edge *)array_new(Edge, 3);

	//--------------------------------------------------------------------------
	// Delete node 0
	//--------------------------------------------------------------------------

	// First node should have 2 edges.
	Graph_GetNode(g, 0, &node);
	Graph_GetNodeEdges(g, &node, GRAPH_EDGE_DIR_BOTH, GRAPH_NO_RELATION, &edges);
	uint edge_count = array_len(edges);
	TEST_ASSERT(edge_count == 2);

	Graph_DeleteEdges(g, edges, edge_count);
	Graph_GetNode(g, 0, &node);
	Graph_DeleteNodes(g, &node, 1);
	
	Graph_ReleaseLock(g);