On 10/06/2014 07:07 AM, varun...@gmail.com wrote: >> Okay, I forgot to explain them. L is a set of links, dist is a >> number (distance), bd is the bandwidth and hc is a number as well >> (hopcount)...different bandwidths, hopcounts and distances for different >> links... b(i,x) is what i intend to calculate out of these details...here >> 'i'could be the head or tail of the link l and x is a node that hosts i >> Thank You > > Unbelievable. I again forgot to express them > L = [(1,3), (5,7), .....] > bd = [23, 34,43.44.....] > dist = [3,7,5,7, ....] > hc = [2,3,4,1,2,2,...] > for every l belonging to L, i could be either 1 or 3 for L[0], similarly for > L[1] it could be 5 or 7
You might want to ask on the scipy mailing list[1]. I'm sure the folks over there deal with complex sums and math all the time. Numpy (standalone, or as part of scipy) has some facilities for working with vectors, products, and summations in an efficient manner. [1] http://mail.scipy.org/mailman/listinfo/scipy-user -- https://mail.python.org/mailman/listinfo/python-list
