Function SingleNodeCycleGraph

tests/unit/test_query_graph.c:147–164

}

QueryGraph *SingleNodeCycleGraph() {
	// create a disjoint graph
	// (A)->(A)
	size_t node_cap = 1;
	size_t edge_cap = 1;

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

	QGNode *A = QGNode_New("A");
	QGEdge *AA = QGEdge_New(relation, "AA");

	QueryGraph *g = QueryGraph_New(node_cap, edge_cap);
	QueryGraph_AddNode(g, A);
	QueryGraph_ConnectNodes(g, A, A, AA);

	return g;
}

void test_QueryGraphClone() {
	// create a triangle graph