Closed TimFinucane closed 6 years ago
Further improvement to the algorithm: Also prune if start time of toBeAdded == latestStartTime && toBeAdded node.id > latestStartTime node id && latestStartTime.node.computationcost > 0
Will explain when im back home
I did this
Further improvement to the algorithm: Also prune if start time of toBeAdded == latestStartTime && toBeAdded node.id > latestStartTime node id && latestStartTime.node.computationcost > 0
Will explain when im back home