Hi all, this is a follow-up question to the one posed above. So, ultimately what I'd like to do in the graph sequence idea above is this:
Assume we are generating an undirected Price network with m=1, so generating a tree. For each time i in the sequence, I would like to identify the node which was newly added (which ought to simply be the one with index i, or maybe i-1) and then extract the degree of the node in the *previous* graph which the new node connected to. Using the graph idea of Tiago, the code I've written looks like: This code seems to work fine, the only problem is that it takes forever. Fortunately the memory taken up isn't very large as per Tiago's help, but even when I try to run this on an N=2000 node graph it takes over 30 seconds (I'm running Ubuntu with an i7 chip and 4g of memory). I would eventually want to run something like this for graphs of 100,000 nodes or larger. My questions are: 1) Where is the performance bottleneck coming from? and 2) Is there an easy way to get around it? Thanks for all your help. Many thanks, -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Generating-a-sequence-of-graphs-tp4025475p4025479.html Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com. _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
