Calculating the diameter of a graph of that size may take quite a lot of time; once I've waited for 11 days for a diameter calculation on a graph with almost 2 million nodes. The segmentation fault worries me a bit, though, it should not happen  the calculation may take a long time but it should not segfault. Is there any chance you can upload your graph somewhere so I can take a look at it and see why it prints a segmentation fault?
Thanks for the reply.
The problem is I have to find the diameter of a graph with around 50,000 nodes. Is there any way in which I can get the results fast?? Right now, my computer hangs and after sometime it says segmentation fault, it works fine for small graphs with around 1,000 nodes.
On Mon, Jan 3, 2011 at 2:40 PM, Tamas Nepusz <address@hidden> wrote:
ok, I guess I asked the wrong question.
1)How should I draw a normal graph having xaxis and yaxis using pyhton igraph. I have attached one graph, please see that.
As I said, igraph does not draw "graphs" as in "charts", igraph draws "graphs" as in "2D drawings of abstract mathematical objects consisting of nodes connected by links". If you want to draw charts, you need another package for that in Pytho; e.g., Matplotlib (http://matplotlib.sf.net). You can calculate the *points* of the chart by igraph (if you want to plot something graphrelated), but you need Matplotlib to draw the chart.
2)If I want a list of the number of linkcuts in my graph, which function should I use.
There is no function for that in igraph, especially because that number can be huge. For instance, consider a graph that consists of 2 100cliques, connected by two edges. Those two connected edges form a minimum cut, hence every cut that includes those two edges will also be a cut. You would have at least 2^(100*99) minimum cuts in that graph.
Also, what functions should I use to find the size of the largest component in my graph\
Find the connected components using the .clusters() method. This returns a VertexClustering object, and you can use its sizes() method to find the sizes of all the clusters. If g is your graph, then it is g.clusters().sizes().
, or to find the average geodesic length.
g.average_path_length(): http://packages.python.org/pythonigraph/igraph.GraphBaseclass.html#average_path_length
3)I have a txt file with some 10,000 nodes and I used the summary function on it, but it seems to take a lot of time to give the results.(In fact, it is still executing after an hour). Is there any other method so that I can get my results quickly. ( The methos works well for small files)
The summary() function calculates the diameter of the graph (among other properties), which may of course take time for larger graphs. If you need only some of the information returned by summary() but not the diameter, you can call other igraph methods to find out what you want. E.g., g.vcount() gives the number of vertices, g.ecount() gives the number of edges, g.maxdegree() gives the maximum degree etc.

