Function test_BFSLevels

tests/unit/test_bfs.c:61–133

}

void test_BFSLevels() {
	QGNode *S;                  // BFS starts here.
	QGNode **nodes;             // Nodes reached by BFS.
	QueryGraph *g;              // Graph traversed.
	int level = 0;              // BFS stops when reach level depth.

	g = BuildGraph();
	// S = QueryGraph_GetNodeByID(g, A->id);
	S = A;

	QGNode *expected_level_0[1] = {A};
	QGNode *expected_level_1[1] = {B};
	QGNode *expected_level_2[2] = {C, D};
	QGNode *expected_level_3[0];
	QGNode *expected_level_deepest[2] = {C, D};

	QGNode **expected[4] = {
		expected_level_0,
		expected_level_1,
		expected_level_2,
		expected_level_3
	};

	//------------------------------------------------------------------------------
	// BFS depth 0 - 3
	//------------------------------------------------------------------------------


	for(; level < 4; level++) {
		nodes = BFS(S, &level);
		QGNode **expectation = expected[level];

		int node_count = array_len(nodes);
		for(int i = 0; i < node_count; i++) {
			bool found = false;
			for(int j = 0; j < node_count; j++) {
				if(nodes[i] == expectation[j]) {
					found = true;
					break;
				}
			}
			TEST_ASSERT(found);
		}

		array_free(nodes);
	}

	//------------------------------------------------------------------------------
	// BFS depth BFS_LOWEST_LEVEL
	//------------------------------------------------------------------------------

	level = BFS_LOWEST_LEVEL;
	nodes = BFS(S, &level);

	// Determine number of expected nodes.
	int expected_node_count = sizeof(expected_level_deepest) / sizeof(expected_level_deepest[0]);
	TEST_ASSERT(expected_node_count == array_len(nodes));