[Top][All Lists]

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

Re: [igraph] Complexity of constructing an MST

From: Tamas Nepusz
Subject: Re: [igraph] Complexity of constructing an MST
Date: Fri, 08 Jul 2011 17:13:44 +0200
User-agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv: Gecko/20110516 Lightning/1.0b2 Thunderbird/3.1.10

> I would greatly appreciate if the authors of the package could
> provide a reference to the algorithm that is actually in use in the
> mst - function.
See my previous email; we indeed use Prim's algorithm and the time
complexity is wrong due to a copy-paste error. It should be O(|E| * log |V|).


reply via email to

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