igraph-help
[Top][All Lists]
Advanced

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

Re: [igraph] two questions from a new member


From: Gábor Csárdi
Subject: Re: [igraph] two questions from a new member
Date: Wed, 10 Dec 2008 13:50:09 +0100

Zhang,

maybe downloading the python-igraph package from

http://pypi.python.org/packages/2.4/p/python-igraph/python-igraph-0.5.win32-py2.4.exe

and extracting the DLL from it would work for you then. I used Visual
Studio to get this DLL, but the 0.5.1 version does not compile with VS
out of the box, I needed to make some changes.

These (the changes) will be in the 0.5.2 version, that should compile
cleanly with (at least some version of) VS, we even supply a project
file.

G.

On Wed, Dec 10, 2008 at 12:12 PM, Zhang Meng <address@hidden> wrote:
> Hi Gabor,
>
> thanks for your reply.
>
> I am more familliar with C than GNU R, so my idea is making a C dynamic link
> library and call the function in Matlab, I know how to call C .dll files in
> Matlab.
>
> So it is more pratical for me  downloading igraph c library and making .dll
> library, but I am a stranger in crossing Unix/Windows software such as
> Cygwin/MinGW, so i want to know how to compile igraph c library...
>
> I agree it is hard to calculate average shortest path length and k-Cliques
> of network with size 100000 and average degree 50, but referring to some
> papers such as "A model for social networks", by Riitta Toivonen alt,
> Physica A 371(2006), 851-860, same size as mt network, k-cliques are given
> in the paper.
>
> So I am confused by their results and want to calculate all the feature
> parameters also, and I have written an email to the author, it seems no
> reply maybe because the author has changed his/her email.
>
> ZHANG MENG
>
> 2008/12/10 Gábor Csárdi <address@hidden>
>>
>> On Wed, Dec 10, 2008 at 8:45 AM, Zhang Meng <address@hidden> wrote:
>> > Hi all,
>> >
>> > This is a new member of igraph solving the calculation of average
>> > shortest
>> > path length, diameter, cluster coefficient, k-cliques etc with
>> > size=100000(nodes) and edge higher 5000000(that is 100000*50),
>> > recommended
>> > by CFinder team for high efficient program.
>> >
>> > Here I downloaded igraph and found it is mainly for Unix environment.
>> > For
>> > me the network model is created using my program in matlab, and want to
>> > call
>> > igraph's functions in matlab under windows environment to calculate its
>> > features such as average shortest path length, k-Cliques..., so can you
>> > tell
>> > me how to compile the igraph using MinGW or other compilers? (As I know,
>> > there are so many compilers in MinGW and I don't know which one to use.)
>>
>> Hi,
>>
>> the easiest would be to install GNU R (www.r-project.org) and then the
>> igraph R package. There is some Matlab package (google for it) to call
>> R directly from Matlab, personally I have never tried it. It is surely
>> possible to call R as an external program from Matlab and R can read
>> and write Matlab files with the R.matlab package.
>>
>> Note that igraph is a library, so you cannot just call it like you
>> would call a program from Matlab. To use igraph in Matlab you would
>> need to write a glue layer that translates Matlab functions into
>> igraph function calls. Currently we have such glue layers to  R and
>> Python only.
>>
>> > Another question is, how long will it take to calculate the average
>> > shortest
>> > path length and k-cliques(where I want to know the number of 3-clique,
>> > 4-clique, 5-clique,...) using functions in igraph?
>>
>> I doubt that you can calculate the average shortest path on such a big
>> graph, it is an O(n^2) algorithm. Similarly, K-cliques might not be
>> feasible in general, probably it is fine for k=3,4,5.
>>
>> I would suggest to install R, and the igraph R package, generate some
>> example graphs with the same density or degree distribution as yours,
>> but in different sizes, and then see how the calculations you want to
>> do scale with the graph size and whether it is feasible to do them.
>>
>> Gabor
>>
>> > thanks
>> >
>> > --
>> > BRs
>> >
>> > ZHANG MENG
>> >
>> > _______________________________________________
>> > igraph-help mailing list
>> > address@hidden
>> > http://lists.nongnu.org/mailman/listinfo/igraph-help
>> >
>> >
>>
>>
>>
>> --
>> Gabor Csardi <address@hidden>     UNIL DGM
>>
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
>
> --
> BRs
>
> ZHANG MENG
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM




reply via email to

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