def deleteNode(self, num): node = self.nodes.get(num, None) #if node == None: #print("rkdel:", n) if heap.GetDependents(node) <= 0: self.nodes.pop(num, None)
def nodeToList(n): #if n == None: #print("ntl:", n) b1 = heap.GetID(n) #print("1", b1) b2 = heap.GetDependents(n) #print("2", b2) b3 = heap.GetStep(n) #print("3", b3) b4 = heap.GetDecision(n) #print("4", b4) b5 = heap.GetParent(n) #print("5", b5) b6 = float(heap.GetTime(n)) #print("6", b6) b7 = float(heap.GetVelocity(n)) #print("7", b7) b8 = (heap.GetGear(n), heap.GetDelta(n), heap.GetTimeToShift(n)) #print("8", b8) b9 = float(heap.GetScore(n)) #print("9", b9) b = [b1, b2, b3, b4, b5, b6, b7, b8, b9] #print(b) return b
def nodeToList(n): return [ heap.GetID(n), heap.GetDependents(n), heap.GetStep(n), heap.GetDecision(n), heap.GetParent(n), float(heap.GetTime(n)), float(heap.GetVelocity(n)), (heap.GetGear(n), heap.GetDelta(n), heap.GetTimeToShift(n)), float(heap.GetScore(n)) ]
def printNode(n): print("ID: ", heap.GetID(n)) print("Dependents: ", heap.GetDependents(n)) print("Step: ", heap.GetStep(n)) print("Decision: ", GetDecision(n)) print("Parent: ", heap.GetParent(n)) print("Time: ", heap.GetTime(n)) print("Velocity: ", heap.GetVelocity(n)) print("Gear: ", heap.GetGear(n)) print("Delta: ", heap.GetDelta(n)) print("Time to shift: ", heap.GetTimeToShift(n)) print("Score: ", heap.GetScore(n))
def deleteNode(self, num): node = self.nodes.get(num, None) if heap.GetDependents(node) <= 0: self.nodes.pop(num, None)