original_docstring: 
  		Builds the dependency graph for the specified list of packages and computes the build order
  		
docstring: Builds the dependency graph for the specified list of packages and computes the build order
docstring_tokens: Builds the dependency graph for the specified list of packages and computes the build order
code: def computeBuildOrder(self, packages):
  		'''
  		Builds the dependency graph for the specified list of packages and computes the build order
  		'''
  		
  		# Build the dependency graph for the packages
  		graph = self.buildDependencyGraph(packages)
  		
  		# Perform a topological sort to determine the build order
  		buildOrder = list(nx.topological_sort(graph))
  		
  		# Determine which packages need to be built
  		if self.rebuild == True:
  			return buildOrder
  		else:
  			return list([p for p in buildOrder if self.isPackageInCache(p) == False])
code_tokens: def computeBuildOrder ( self , packages ) : graph = self . buildDependencyGraph ( packages ) buildOrder = list ( nx . topological_sort ( graph ) ) if self . rebuild == True : return buildOrder else : return list ( [ p for p in buildOrder if self . isPackageInCache ( p ) == False ] )
short_docstring: Builds the dependency graph for the specified list of packages and computes the build order
short_docstring_tokens: Builds the dependency graph for the specified list of packages and computes the build order
comment: '''
  		Builds the dependency graph for the specified list of packages and computes the build order
  		'''$SEP$# Build the dependency graph for the packages$SEP$# Perform a topological sort to determine the build order$SEP$# Determine which packages need to be built