Re: [igraph] Running time

[Tamas Nepusz]

Hi Albert,

>   Hello!  If i run a clustering algorithm in R, how can i get the
>   running time?
Use system.time, e.g.:

> system.time(fastgreedy.community(graph))


> I tried to  run the CNM algorithm, and i got this error message:  At
> fast_community.c:525 : fast greedy community detection works for
> undirected graphs only, Unimplemented function
As the message says above, this algorithm works for undirected graphs
only, and your graph is directed. Please convert it to an undirected one
first using to.undirected(). If you load your graph from an external
file, the loader function might also have a directed=... parameter where
you can explicitly specify that you want the graph to be undirected.
(This works only for formats such as edgelist, NCOL and LGL where the
file itself does not contain whether the graph is directed or
undirected).

-- 
Tamas