Function test_path

tests/unit/test_value.c:344–449

}

void test_path() {
	Path *path = Path_New(3);
	Path *clone;
	Node *n;
	Edge *e;

	// Path should be empty.
	TEST_ASSERT(Path_NodeCount(path) == 0);
	TEST_ASSERT(Path_EdgeCount(path) == 0);
	TEST_ASSERT(Path_Len(path) == 0);

	// Populate path.
	Node ns[3];
	Edge es[2];
	for (uint i = 0; i < 2; i++) {
		ns[i].id = i;
				
		es[i].id = i;
		es[i].src_id = i;
		es[i].dest_id = i + 1;
	}
	ns[2].id = 2;

	for (uint i = 0; i < 2; i++) {
		Path_AppendNode(path, ns[i]);	
		Path_AppendEdge(path, es[i]);
	}
	Path_AppendNode(path, ns[2]);

	TEST_ASSERT(Path_NodeCount(path) == 3);
	TEST_ASSERT(Path_EdgeCount(path) == 2);
	TEST_ASSERT(Path_Len(path) == 2);

	// Make sure all nodes and edges are in path.
	for (uint i = 0; i < 2; i++) {
		n = Path_GetNode(path, i);
		TEST_ASSERT(n->id == i);		
		e = Path_GetEdge(path, i);
		TEST_ASSERT(e->id == i);
	}
	n = Path_GetNode(path, 2);
	TEST_ASSERT(n->id == 2);

	clone = Path_Clone(path);
	// Make sure all nodes and edges are in path.
	for (uint i = 0; i < 2; i++) {
		n = Path_GetNode(clone, i);
		TEST_ASSERT(n->id == i);
		e = Path_GetEdge(clone, i);
		TEST_ASSERT(e->id == i);
	}
	n = Path_GetNode(clone, 2);
	TEST_ASSERT(n->id == 2);

	Node head = Path_Head(path);
	TEST_ASSERT(head.id == 2);

	Path_Reverse(path);