local_search/local_search.py
def find_minimal_feasible(self, blacklist=[]):
		''' Tries to close down as many slots as possible until no longer possible.
		But don't close the slots in blacklist. '''
		slots_closed = []
		for t in range(self.T):
			if t in blacklist: continue
			if self.g[t][self.SINK]['capacity'] == 0: continue
			self.g[t][self.SINK]['capacity'] = 0
			if self.is_schedule_feasible():
				slots_closed.append(t)
			else:
				self.g[t][self.SINK]['capacity'] = self.B
		return slots_closed
 Tries to close down as many slots as possible until no longer possible.
		But don't close the slots in blacklist. 
Tries to close down as many slots as possible until no longer possible.
But don't close the slots in blacklist.
Tries to close down as many slots as possible until no longer possible . But don ' t close the slots in blacklist .
def find_minimal_feasible(self, blacklist=[]):
		slots_closed = []
		for t in range(self.T):
			if t in blacklist: continue
			if self.g[t][self.SINK]['capacity'] == 0: continue
			self.g[t][self.SINK]['capacity'] = 0
			if self.is_schedule_feasible():
				slots_closed.append(t)
			else:
				self.g[t][self.SINK]['capacity'] = self.B
		return slots_closed
def find_minimal_feasible ( self , blacklist = [ ] ) : slots_closed = [ ] for t in range ( self . T ) : if t in blacklist : continue if self . g [ t ] [ self . SINK ] [ 'capacity' ] == 0 : continue self . g [ t ] [ self . SINK ] [ 'capacity' ] = 0 if self . is_schedule_feasible ( ) : slots_closed . append ( t ) else : self . g [ t ] [ self . SINK ] [ 'capacity' ] = self . B return slots_closed
Tries to close down as many slots as possible until no longer possible.
Tries to close down as many slots as possible until no longer possible .
''' Tries to close down as many slots as possible until no longer possible.
		But don't close the slots in blacklist. '''
self
blacklist