Mazes/tests/test_part1.cpp at main · SwaroopTha/Mazes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <catch2/catch_test_macros.hpp>
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <stack>
#include "cs225/PNG.h"
#include "dsets.h"
#include "maze.h"
#include "mazereader.h"

using namespace cs225;
using namespace std;


TEST_CASE("addElements1", "[weight=10][part1]")
{
	DisjointSets disjSets;
	disjSets.addelements(5);
	REQUIRE(3 == disjSets.find(3));
}

TEST_CASE("addElements2", "[weight=10][part1]")
{
	DisjointSets disjSets;
	disjSets.addelements(5);
	REQUIRE(0 == disjSets.find(0));
	disjSets.addelements(5);
	REQUIRE(9 == disjSets.find(9));
}

TEST_CASE("testFindAndSetUnion1", "[weight=10][part1]")
{
	DisjointSets disjSets;
	disjSets.addelements(4);
	disjSets.setunion(1, 2);
	REQUIRE(disjSets.find(2) == disjSets.find(1));
}

TEST_CASE("testFindAndSetUnion2", "[weight=10][part1]")
{
	DisjointSets disjSets;
	disjSets.addelements(10);

	disjSets.setunion(4, 8);
	disjSets.setunion(1, 3);
	disjSets.setunion(1, 5);
	disjSets.setunion(8, 3);
	disjSets.setunion(6, 7);
	disjSets.setunion(2, 8);
	disjSets.setunion(7, 1);

	int root = disjSets.find(1);
	for (int i = 2; i <= 8; i++)
		REQUIRE(root == disjSets.find(i));
	REQUIRE(disjSets.find(0) != disjSets.find(9));
}

TEST_CASE("testFindAndSetUnion3", "[weight=10][part1]")
{
	DisjointSets disjSets;
	disjSets.addelements(8);

	disjSets.setunion(1, 2);
	disjSets.setunion(1, 3);
	disjSets.setunion(4, 5);
	disjSets.setunion(4, 6);
	disjSets.setunion(3, 6);

	REQUIRE(disjSets.find(4) == disjSets.find(1));
	REQUIRE(disjSets.find(0) != disjSets.find(4));
}

TEST_CASE("size1", "[weight=5][part1]")
{
	DisjointSets disjSets;
	disjSets.addelements(4);
	REQUIRE(1 == disjSets.size(2));
}

TEST_CASE("size2", "[weight=10][part1]")
{
	DisjointSets disjSets;
	disjSets.addelements(8);

	disjSets.setunion(1, 7);
	disjSets.setunion(2, 6);
	disjSets.setunion(3, 5);
	disjSets.setunion(2, 3);
	REQUIRE(4 == disjSets.size(3));
	disjSets.setunion(1, 3);
	REQUIRE(6 == disjSets.size(6));

}