Hi,
Do you know if there’s a Processing library to make node-based tree graphs (other than the correlation library that is unfortunaltely not P3 compatible) ?
Thanks.
Have you already tried to contact them by e-mail or Facebook for its source code? 
No, I did not. Should I ?
There’s a high probability that converting that library to Processing 3.4 would be just some little fixes here and there. Nothing too complicated! 
So it’s worth a try to get ahold of the source code IMO. 
I see. But I guess it would be more about requesting permission rather than asking for the source code since we already have the possibility to access it (with a Java decompiler like JD-GUI for instance). Right ?
W/ a decompiler, everything would be a mess, b/c all labels for variables, methods, etc. would be lost! 
Ok, I’ll give it a shot (contacting them).
Ah, I remember looking at Correlations a while back.
The strange thing is, I think Correlations was originally distributed with the source code. From the old (broken) blog post:
http://mstest1234.blogspot.com/
You can download the library package including the source code and 3 Processing examples here.
The later reposting to correlations library | has the jar and examples, but does not include the source code, even though it is the same version number.
I’ve quickly looked inside the class files with http://www.javadecompilers.com/ using the CFR decompiler, and most of the decompile is pretty clean (although a few key parts of Node.java and Graph.java are quite messy). I’ve never actually used it for a project – instead I have used GraphStream.
1 Like