Skip to content
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

Improve graph layout algorithm #18

Open
todo bot opened this issue Jan 29, 2020 · 0 comments
Open

Improve graph layout algorithm #18

todo bot opened this issue Jan 29, 2020 · 0 comments
Labels
help-wanted Extra attention is needed

Comments

@todo
Copy link

todo bot commented Jan 29, 2020

Graph layout algorithm is a brute force n-body, with algorithmical complexity of O(n^2), with n the number of nodes. There are algorithms that achieve at least O(n*log(n)) complexity, but they require a b-tree creation. We need to investigate at how many nodes the nlog(n) algorithm starts to make sense and whether or not this is actually useful in real life due to data pollution.


This issue was generated by todo based on a todo comment in dbd2586.
@todo todo bot added the help-wanted Extra attention is needed label Jan 29, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
help-wanted Extra attention is needed
Projects
None yet
Development

No branches or pull requests

0 participants