2020-01-09 21:55:08 +0100 commented question How to find the sum weight on a vertex I wanted to obtain an antimagic labeling. A graph G is antimagic if there exists a bijective edge labeling from E(G) to {1,..., |E(G)|} such that the vertex sums are pairwise distinct. If you have another code, I will appreciate if you tell me. 2020-01-09 21:48:36 +0100 commented question How to find the sum weight on a vertex @John q=G.num_edges() I get these errors:  Traceback (most recent call last): n.append(x) File "", line 1, in File "/private/var/folders/v7/j_ry66_d0s333h_720qz836c0000gn/T/tmpu6JFBi/___code___.py", line 7 for i in G.vertex_iterator(): ^ IndentationError: unexpected indent  2020-01-09 16:51:11 +0100 asked a question How to find the sum weight on a vertex Hi I want to define a random labeling on edges of a graph (without duplicate labels ) and then find the sum of the weights of incident edges to each vertex. Here is code I wrote: n=[] import random W=random.sample(G.num_edges(),G.num_edges()) w_edges = [(E[i][0], E[i][1], W[i]) for i in xrange(q)] for i in G.vertex_iterator(): x=sum(W[k] for k in G.neighbor_iterator(i)) n.append(x)  But I receive some errors. I'll be happy if you can help me.