Function DisjointGraph

tests/unit/test_query_graph.c:122–145

}

QueryGraph *DisjointGraph() {
	// create a disjoint graph
	// (A)->(B) (C)
	size_t node_cap = 3;
	size_t edge_cap = 1;

	// 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");

	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);

	return g;
}

QueryGraph *SingleNodeCycleGraph() {
	// create a disjoint graph