def setup_igraph(self):
		self.ig_ER_G = ig.Graph()
		self.ig_ER_G.add_vertices(len(self.ER_G))
		self.ig_ER_G.add_edges(self.ER_G.edges())
		# Edges are enumerated twice, so while building the weight vector we make sure that the opposite-direction weight wasn't added
		wweights = {}
		for i,j in self.ig_ER_G.get_edgelist():
			if i >= wweights and j not in wweights[i]:
				wweights[i][j] = True 
				self.weights.append(self.ER_G.weight(i, j))
dataset/ETHPy150Open networkdynamics/zenlib/src/zen/benchmarks/spanning.py/MinimumSpanningTreeBenchmark.setup_igraph/operator `in` -> `>=`