Function BuildGraph

tests/unit/test_all_paths.c:19–55

#include "acutest.h"

static Graph *BuildGraph() {
	Edge e;
	Node n;
	size_t nodeCount = 4;
	Graph *g = Graph_New(nodeCount, nodeCount);
	int relation = Graph_AddRelationType(g);
	for(int i = 0; i < 4; i++) {
		n = GE_NEW_NODE();
		Graph_CreateNode(g, &n, NULL, 0);
	}

	/* Connections:
		* 0 -> 1
		* 0 -> 2
		* 1 -> 0
		* 1 -> 2
		* 2 -> 1
		* 2 -> 3
		* 3 -> 0 */

	// Connections:
	// 0 -> 1
	Graph_CreateEdge(g, 0, 1, relation, &e);
	// 0 -> 2
	Graph_CreateEdge(g, 0, 2, relation, &e);
	// 1 -> 0
	Graph_CreateEdge(g, 1, 0, relation, &e);
	// 1 -> 2
	Graph_CreateEdge(g, 1, 2, relation, &e);
	// 2 -> 1
	Graph_CreateEdge(g, 2, 1, relation, &e);
	// 2 -> 3
	Graph_CreateEdge(g, 2, 3, relation, &e);
	// 3 -> 0
	Graph_CreateEdge(g, 3, 0, relation, &e);
	return g;
}

// This function tests for membership of a path, inside an array of multiple paths.
bool pathArrayContainsPath(NodeID **array, int arrayLen, Path *path) {