Function test_getEdge

tests/unit/test_graph.c:354–464

}

void test_getEdge() {
	/* Create a graph with both nodes and edges.
	 * Make sure edge retrival works as expected:
	 * 1. try to get edges by ID
	 * 2. try to get edges connecting source to destination node
	 * 3. try to get none existing edges. */

	Node n;
	Edge e;
	int relationCount = 4;
	size_t nodeCount = 5;
	size_t edgeCount = 5;
	int relations[relationCount];

	Graph *g = Graph_New(nodeCount, nodeCount);
	Graph_AcquireWriteLock(g);
	for(int i = 0; i < nodeCount; i++) {
		n = GE_NEW_NODE();
		Graph_CreateNode(g, &n, NULL, 0);
	}
	for(int i = 0; i < relationCount; i++) relations[i] = Graph_AddRelationType(g);

	/* Connect nodes:
	 * 1. nodes (0-1) will be connected by relation 0.
	 * 2. nodes (0-1) will be connected by relation 1.
	 * 3. nodes (1-2) will be connected by relation 1.
	 * 4. nodes (2-3) will be connected by relation 2.
	 * 5. nodes (3-4) will be connected by relation 3. */

	Graph_CreateEdge(g, 0, 1, relations[0], &e);
	Graph_CreateEdge(g, 0, 1, relations[1], &e);
	Graph_CreateEdge(g, 1, 2, relations[1], &e);
	Graph_CreateEdge(g, 2, 3, relations[2], &e);
	Graph_CreateEdge(g, 3, 4, relations[3], &e);

	// Validations
	// Try to get edges by ID
	for(EdgeID i = 0; i < edgeCount; i++) {
		Graph_GetEdge(g, i, &e);
		TEST_ASSERT(e.attributes != NULL);
		TEST_ASSERT(e.id == i);
	}

	// Try to get edges connecting source to destination node.
	NodeID src;
	NodeID dest;
	int relation;
	Edge *edges = (Edge *)array_new(Edge, 4);

	/* Get all edges connecting node 0 to node 1,
	 * expecting 2 edges. */
	src = 0;
	dest = 1;
	relation = GRAPH_NO_RELATION;   // Relation agnostic.
	Graph_GetEdgesConnectingNodes(g, src, dest, relation, &edges);
	TEST_ASSERT(array_len(edges) == 2);
	for(int i = 0; i < 2; i++) {
		e = edges[i];