Re: [igraph] pagerank implementation questions

[stainless steel some one]

Thanks for all the great answers.

I read from the website: 

"This is another library for creating and manipulating
graphs. There is simply no other graph library out
there which can be handle graphs of the size the
author is confronted with efficiently."

I just wonder what's the largest graph that igraph
developers have used with igraph, and what's the
performance of pagerank convergence speed (in
particular)? if you can put some numbers there, it
will be more convincing :-)


BTW, I noticed that igraph is under GNU license. Can
it be changed to something slightly different (e.g.
wxWidgets Licence,
http://wxwidgets.org/about/newlicen.htm) to allow
binary linking with the library?  this guarantees:

-- any enhancement to the library itself is always
contributed back;

-- but if an application just use igraph, it can link
and generate a binary executable which doesn't fall
under GPL?




=======================================================================
-- Judging people by the non/sense he makes, not the name he bears.
-- intelligence = openminded + compassionate

"I don't see why the sex of the candidate is relevant -- this is after all an 
academic institution not a bath house!" -- Hilbert on Noether's not being 
offered a professorship from University of Göttingen.
=======================================================================


 
____________________________________________________________________________________
Have a burning question?  
Go to www.Answers.yahoo.com and get answers from real people who know.