def bm_igraph(self):
		G = ig.Graph()
		
		# add nodes
		node_lookup = {}
		G.add_vertices(self.NUM_NODES)
		for i in range(self.NUM_NODES):
			node_lookup[i] = i
		
		# add edges
		num_nodes = self.NUM_NODES
		i = 0
		ni = 0
		nj = 1
		edges = []
		while i < self.NUM_EDGES:
			edges.append( (ni,nj) )
			i += 1
			
			nj += 1
			if nj >= num_nodes:
				ni += 1
				nj = ni + 1
		 	
		G.add_edges(edges)
dataset/ETHPy150Open networkdynamics/zenlib/src/zen/benchmarks/graph.py/NonRandomGraphBenchmark.bm_igraph/original