Re: [igraph] pagerank implementation questions

[stainless steel some one]

> If you think an algorithm could be significantly
> faster please report it, 
> this is considered as a bug in igraph. :)
> 
> Summary. If your graph fits into the memory then
> igraph is good enough for you for most algorithms.
> 

Sounds great, and it's reasonable assumption.

> 
> Please consider that i'm a
> programmer and not a lawyer.

Me neither :-)

But from my past reading, there are some issues even
regarding static/dynamic linking, blah, blah, ...
whether it should be considered as derived work in
case of LGPL. So they come up with that exception. 

An example would be: suppose application A (licensed
L) use two libraries B (GPL) & C (other license X);
then how should the binary be distributed?

B's GPL requires to disclose all the souce code of A &
C? but this may not be possible with L and X's
licenses' term.

For your concern, maybe you can add two more words, as
 underscored in the following:

"2. The exception is that you may use, copy, link,
 modify and distribute under your own terms, binary
object code versions of works based on the __unchanged
original__ Library."

I think the intent is clear:
-- enhancement to library itself should be contributed
back
-- while allow application to use the library in
binary form.



=======================================================================
-- 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.
=======================================================================


 
____________________________________________________________________________________
Do you Yahoo!?
Everyone is raving about the all-new Yahoo! Mail beta.
http://new.mail.yahoo.com