def test_add_tasks_consecutively(self):
""" Adds tasks in consecutive positions. Example
position 1, position 2, ...
"""
print("--->Adding tasks consecutively...")
stnu = STNU()
for i, task in enumerate(self.tasks):
stnu.add_task(task, i + 1)
n_nodes = 3 * len(self.tasks) + 1
n_edges = 2 * (5 * len(self.tasks) + len(self.tasks) - 1)
print("N nodes: ", n_nodes)
print("N edges: ", n_edges)
print(stnu)
self.assertEqual(n_nodes, stnu.number_of_nodes())
self.assertEqual(n_edges, stnu.number_of_edges())
def test_remove_task_beginning(self):
print("--->Removing task at the beginning...")
stnu = STNU()
# Add all tasks
for i, task in enumerate(self.tasks):
stnu.add_task(task, i + 1)
# Remove task in position 1
stnu.remove_task(1)
added_tasks = self.tasks[:-1]
n_nodes = 3 * len(added_tasks) + 1
n_edges = 2 * (5 * len(added_tasks) + len(added_tasks) - 1)
print("N nodes: ", n_nodes)
print("N edges: ", n_edges)
print(stnu)
self.assertEqual(n_nodes, stnu.number_of_nodes())
self.assertEqual(n_edges, stnu.number_of_edges())
def test_add_task_middle(self):
print("--->Adding task in the middle...")
stnu = STNU()
# Add task in position 1
stnu.add_task(self.tasks[0], 1)
# Adds task in position 2.
stnu.add_task(self.tasks[1], 2)
print(stnu)
# Add a new task in position 2. Displace existing task at position 2 to position 3
stnu.add_task(self.tasks[2], 2)
print(stnu)
n_nodes = 3 * len(self.tasks) + 1
n_edges = 2 * (5 * len(self.tasks) + len(self.tasks) - 1)
print("N nodes: ", n_nodes)
print("N edges: ", n_edges)
self.assertEqual(n_nodes, stnu.number_of_nodes())
self.assertEqual(n_edges, stnu.number_of_edges())
def test_add_task_beggining(self):
"""Adds task at the beginning. Displaces the other tasks
"""
print("--->Adding task at the beginning...")
stnu = STNU()
# Adds the first task in position 1
stnu.add_task(self.tasks[0], 1)
print(stnu)
# Adds a new task in position 1. Displaces existing task at position 1 to position 2
stnu.add_task(self.tasks[1], 1)
print(stnu)
# We added two tasks
added_tasks = [self.tasks[0], self.tasks[1]]
n_nodes = 3 * len(added_tasks) + 1
n_edges = 2 * (5 * len(added_tasks) + len(added_tasks) - 1)
print("N nodes: ", n_nodes)
print("N edges: ", n_edges)
print(stnu)
self.assertEqual(n_nodes, stnu.number_of_nodes())
self.assertEqual(n_edges, stnu.number_of_edges())