forked from gabriel301/DiscreteOptimizationCoursera
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathForest.py
100 lines (76 loc) · 3.33 KB
/
Forest.py
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
95
96
97
98
99
from Tree import Tree
class Forest:
def __init__(self):
self.Trees = {}
self.TotalCost = 0
self.TreesCount = 0
self.TotalNodes = 0
def addTree(self,tree):
if tree.getRoot().index in self.Trees.keys():
self.removeTree(tree)
self.Trees[tree.getRoot().index] = tree
self.TotalCost = self.TotalCost + tree.getCost()
self.TreesCount = self.TreesCount + 1
self.TotalNodes = self.TotalNodes + len(tree.getNodes())
def removeTree(self,facilityIndex):
if facilityIndex in self.Trees.keys():
self.TotalCost = self.TotalCost - self.Trees[facilityIndex].getCost()
self.TotalNodes = self.TotalNodes - len(self.Trees[facilityIndex].getNodes())
self.Trees.pop(facilityIndex,None)
self.TreesCount = self.TreesCount - 1
def buildForestFromArray(self,assignments,facilities,customers):
print("Building Forest from Assignment Array...")
size = len(assignments)
self.reset()
for index in range(0,size):
if(assignments[index] not in self.Trees.keys()):
self.Trees[assignments[index]] = Tree(facilities[assignments[index]])
self.Trees.get(assignments[index]).addNode(customers[index])
for tree in self.Trees.values():
self.TotalCost = self.TotalCost + tree.getCost()
self.TotalNodes = self.TotalNodes + len(tree.getNodes())
self.TreesCount = self.TreesCount + 1
def buildForestFromDict(self,assignments,facilities,customers):
print("Building Forest from Assignment Dict...")
for customer in assignments.keys():
if(assignments.get(customer) not in self.Trees.keys()):
self.Trees[assignments.get(customer)] = Tree(facilities[assignments.get(customer)])
self.Trees.get(assignments.get(customer)).addNode(customers[customer])
for tree in self.Trees.values():
self.TotalCost = self.TotalCost + tree.getCost()
self.TotalNodes = self.TotalNodes + len(tree.getNodes())
self.TreesCount = self.TreesCount + 1
def getAssignmentsArray(self):
assignments = [None]*self.TotalNodes
for tree in self.Trees.values():
for node in tree.getNodes().values():
assignments[node.index] = tree.getRoot().index
return assignments
def getTrees(self):
return self.Trees
def getTotalCost(self):
return self.TotalCost
def getTotalNodes(self):
return self.TotalNodes
def getTreesCount(self):
return self.TreesCount
def reset(self):
self.Trees.clear()
self.TotalCost = 0
self.TotalNodes = 0
self.TreesCount = 0
def getData(self):
facilities = []
customers = []
for tree in self.Trees.values():
facilities.append(tree.getRoot())
customers.extend(tree.getNodes().values())
return facilities,customers
def updateStatistics(self):
self.TotalCost = 0
self.TotalNodes = 0
self.TreesCount = 0
for tree in self.Trees.values():
self.TreesCount = self.TreesCount + 1
self.TotalNodes = self.TotalNodes + len(tree.getNodes())
self.TotalCost = self.TotalCost + tree.getCost()