Function _build_graph

tests/unit/test_algebraic_expression.c:93–138

Create a graph containing: * Entities: 'people' and 'countries'. * Relations: 'friend', 'visit' and 'war'. */

	* Entities: 'people' and 'countries'.
	* Relations: 'friend', 'visit' and 'war'. */
static void _build_graph() {
	GraphContext *gc = QueryCtx_GetGraphCtx();

	Node n;
	Graph *g = gc->g;
	Graph_AcquireWriteLock(g);

	size_t city_count = 2;
	size_t person_count = 2;
	size_t node_count = person_count + city_count;

	// Introduce person and country labels.
	int city_label[1] = {GraphContext_GetSchema(gc, "City", SCHEMA_NODE)->id};
	int person_label[1] = {GraphContext_GetSchema(gc, "Person", SCHEMA_NODE)->id};
	Graph_AllocateNodes(g, node_count);

	for(int i = 0; i < person_count; i++) {
		n = GE_NEW_NODE();
		Graph_CreateNode(g, &n, person_label, 1);
	}

	for(int i = 0; i < city_count; i++) {
		n = GE_NEW_NODE();
		Graph_CreateNode(g, &n, city_label, 1);
	}

	// Creates a relation matrices.
	GrB_Index war_relation_id = GraphContext_GetSchema(gc, "war", SCHEMA_EDGE)->id;
	GrB_Index visit_relation_id = GraphContext_GetSchema(gc, "visit", SCHEMA_EDGE)->id;
	GrB_Index friend_relation_id = GraphContext_GetSchema(gc, "friend", SCHEMA_EDGE)->id;

	// Introduce relations, connect nodes.
	Edge e;
	Graph_CreateEdge(g, 0, 1, friend_relation_id, &e);
	Graph_CreateEdge(g, 1, 0, friend_relation_id, &e);

	Graph_CreateEdge(g, 0, 2, visit_relation_id, &e);
	Graph_CreateEdge(g, 0, 3, visit_relation_id, &e);
	Graph_CreateEdge(g, 1, 2, visit_relation_id, &e);

	Graph_CreateEdge(g, 2, 3, war_relation_id, &e);
	Graph_CreateEdge(g, 3, 2, war_relation_id, &e);

	Graph_ApplyAllPending(g, true);
	Graph_ReleaseLock(g);
}

static void _bind_matrices() {
	int mat_id;