[Top][All Lists]

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

Re: [igraph] using algorithms on a graph

From: Gabor Csardi
Subject: Re: [igraph] using algorithms on a graph
Date: Mon, 21 Apr 2008 17:52:26 +0200
User-agent: Mutt/1.5.13 (2006-08-11)


in order to answer this, you'll need to send us at least the 
error messages you get, together with a small piece of 
example code would be even better.

In general, there is nothing extra to do, after calling graph()
you can call the community structure detection routines.


ps. please consider joining the list, otherwise your
messages might be delayed, this is to avoid spam on the list.

On Mon, Apr 21, 2008 at 04:25:14PM +0100, Daniel Butts wrote:
> I am new with igraph and using R and am trying to use a couple of the 
> community
> detection algorithms on a graph I have. My data consists of a .csv file with
> two columns with each row representing an edge. I have taken the columns of
> this file and put them into a matrix (m) and used the g<-graph(t(m)) command 
> to
> create my graph. I now want to use the fast-greedy and leading eigenvector
> algorithms on this graph however when I copy the command in the manual I keep
> getting error messages, is there something extra I need to do for the
> algorithms to work?

> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Csardi Gabor <address@hidden>    UNIL DGM

reply via email to

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