Function BuildGraph

tests/unit/test_dfs.c:27–57

static QGEdge *CD;

static QueryGraph *BuildGraph() {
	// (A)->(B)
	// (B)->(C)
	// (C)->(D)
	size_t node_cap = 4;
	size_t edge_cap = 3;

	// Create nodes.
	const char *relation = "R";

	A = QGNode_New("A");
	B = QGNode_New("B");
	C = QGNode_New("C");
	D = QGNode_New("D");

	AB = QGEdge_New(relation, "AB");
	BC = QGEdge_New(relation, "BC");
	CD = QGEdge_New(relation, "CD");

	QueryGraph *g = QueryGraph_New(node_cap, edge_cap);
	QueryGraph_AddNode(g, A);
	QueryGraph_AddNode(g, B);
	QueryGraph_AddNode(g, C);
	QueryGraph_AddNode(g, D);

	QueryGraph_ConnectNodes(g, A, B, AB);
	QueryGraph_ConnectNodes(g, B, C, BC);
	QueryGraph_ConnectNodes(g, C, D, CD);

	return g;
}

void test_DFSLevels() {
	QGNode *S;      // DFS starts here.