public void BruteForceSolution_EmptyListOfLectures_ShouldRetornEmptyListOfLecture()
{
var maximumCombinationsOfActivities = new AlgorithmsAndDataStructures.Algorithms.MaximumCombinationOfActivities.MaximumCombinationsOfActivities();
var listOfLectures = new List <Lecture>();
var expected = new List <Lecture>();
var actual = maximumCombinationsOfActivities.BruteForceSolution(listOfLectures);
Assert.IsTrue(expected.SequenceEqual(actual));
}
public void BruteForceSolution_GeneralComplexTest3()
{
var maximumCombinationsOfActivities = new AlgorithmsAndDataStructures.Algorithms.MaximumCombinationOfActivities.MaximumCombinationsOfActivities();
var listOfLectures = new List <Lecture>()
{
new Lecture(new DateTime(2019, 08, 30, 10, 0, 0), new DateTime(2019, 08, 30, 14, 0, 0), false),
new Lecture(new DateTime(2019, 08, 30, 10, 0, 0), new DateTime(2019, 08, 30, 11, 0, 0), false),
new Lecture(new DateTime(2019, 08, 30, 11, 0, 0), new DateTime(2019, 08, 30, 13, 0, 0), true),
new Lecture(new DateTime(2019, 08, 30, 13, 0, 0), new DateTime(2019, 08, 30, 14, 0, 0), false),
new Lecture(new DateTime(2019, 08, 30, 14, 0, 0), new DateTime(2019, 08, 30, 20, 0, 0), true),
};
var expected = new List <Lecture>()
{
new Lecture(new DateTime(2019, 08, 30, 10, 0, 0), new DateTime(2019, 08, 30, 14, 0, 0), false),
new Lecture(new DateTime(2019, 08, 30, 14, 0, 0), new DateTime(2019, 08, 30, 20, 0, 0), true),
};
var actual = maximumCombinationsOfActivities.BruteForceSolution(listOfLectures);
Assert.IsTrue(expected.SequenceEqual(actual));
}