Math package

[diffuser78 at gmail.com]

I will write the problem a little more clearer so that you guys can
recommend me better.

In a graphs of size N ( where, N = 1e9), each node has a degree D=1000.
i.e There are overall (D*N)/2 edges in the graph. This graph needs to
be generated randomly using the program.

Now my task is to find the shortest distance from each node to every
other node. And finally I want to find is the average distance from one
node to another node in the graph. This is an average Erdos number or
equivalently what degree of seperation exists in the graph.

I can start with low values of N and D but my ultimate aim is to
simulate this graph on big values of N and D.

Every help is greatly appreciated.

Thanks


bearophileHUGS at lycos.com wrote:
> diffuser78 at gmail.com:
> > I want to write a program which would have a 2 dimensional array of 1
> > billion by 1 billion. This is for computational purposes and evaluating
> > a mathematical concept similar to Erdos number.
>
> Maybe you are talking about the edges of a graph with 1e9 nodes. This
> structure is surely quite sparse, so you don't need to store the edges
> in a matrix, you can manage is as a sparse structure, and maybe you
> don't need a Blue Gene.
>
> If you find ways to clean your data, reduce the vertex and arc count,
> and if you have a lot of memory, then maybe Boost Graph for Python may
> suffice:
> http://www.osl.iu.edu/~dgregor/bgl-python/
> 
> Bye,
> bearophile