original_docstring: 
  		Builds the dependency graph for the specified list of packages
  		
docstring: Builds the dependency graph for the specified list of packages
docstring_tokens: Builds the dependency graph for the specified list of packages
code: def buildDependencyGraph(self, packages):
  		'''
  		Builds the dependency graph for the specified list of packages
  		'''
  		
  		# Create the DAG that will act as our dependency graph
  		graph = nx.DiGraph()
  		
  		# Iteratively process our list of packages
  		toProcess = deque(packages)
  		while len(toProcess) > 0:
  			
  			# Add the current package to the graph
  			current = toProcess.popleft()
  			graph.add_node(current)
  			
  			# Retrieve the dependencies for the package and add them to the graph
  			deps = self.extractDependencies(current)
  			for dep in deps:
  				graph.add_node(dep)
  				graph.add_edge(dep, current)
  				toProcess.append(dep)
  		
  		return graph
code_tokens: def buildDependencyGraph ( self , packages ) : graph = nx . DiGraph ( ) toProcess = deque ( packages ) while len ( toProcess ) > 0 : current = toProcess . popleft ( ) graph . add_node ( current ) deps = self . extractDependencies ( current ) for dep in deps : graph . add_node ( dep ) graph . add_edge ( dep , current ) toProcess . append ( dep ) return graph
short_docstring: Builds the dependency graph for the specified list of packages
short_docstring_tokens: Builds the dependency graph for the specified list of packages
comment: '''
  		Builds the dependency graph for the specified list of packages
  		'''$SEP$# Create the DAG that will act as our dependency graph$SEP$# Iteratively process our list of packages$SEP$# Add the current package to the graph$SEP$# Retrieve the dependencies for the package and add them to the graph