-
Notifications
You must be signed in to change notification settings - Fork 33
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Build pre-filtered networks #109
Comments
Two approaches --
|
While we now output GEXF as of #137, we are still interested in creating "sufficient analytic data to create attractive graphs in sigma.js." Some thoughts from @greebie:
|
Re-named to remove references to GEXF, which is resolved. The goal is to have a nice attractive network out of the box and avoid the "Borg cube" in Gephi. Looking at GraphStream and other scripts, the best we can do is O(n^2) which would not work for large networks. I could try to produce a script that checks for size first. |
This is being handled outside of AUT with borg-reducer |
Create a network output that includes sufficient analytic data to create attractive graphs in sigma.js.
The text was updated successfully, but these errors were encountered: