Function AcyclicBuildGraph

tests/unit/test_detect_cycle.c:19–43

#include "acutest.h"

QueryGraph *AcyclicBuildGraph() {
	// (A)->(B)->(C)
	size_t node_cap = 3;
	size_t edge_cap = 2;

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

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

	return g;
}

QueryGraph *CyclicBuildGraph() {
	// (A)->(B)->(C)->(D)->(E)->(B)->(F)->(G)->(C)