[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] decompose time

From: Bernie Hogan
Subject: [igraph] decompose time
Date: Thu, 19 Apr 2012 23:03:15 +0100

Hi all, 

It seems that decompose() is taking a devastatingly long time (i.e. ~20 minutes) on a network of around 150k nodes and 150k edges. Why shouldn't this run in near linear or n log n time, where n is number of edges. Do I have to do something to the data structure first? 

I realize that's not actually THAT long a time to wait for a result, but I would have assumed that I can envision finding weakly connected components as a relatively straightforward greedy algorithm walking along a path.  

iGraph 0.5.3, 32-bit python 2.6, Mac 10.7.3. 

Take care,

Dr Bernie Hogan
Research Fellow, Oxford Internet Institute
University of Oxford

reply via email to

[Prev in Thread] Current Thread [Next in Thread]