Closed haishuangsu closed 2 years ago
I have the same issue. A fix would be great.. At least a proposal to fix it. I could also fix it and create a PR.
I wish I could help, but the entire foundation might need to be changed.
Can you explain what you mean by that? What are the flaws of this foundation and how can we improve this?
I quickly looked into the Issue and it looks like that nodeOrdering
using your median heuristic is taking too much time.
I would love to chat with you about potential fixes that I can implement and add a pull request.
Thanks for the call @JulianBissekkou . Appreciate it
I did some more research and tried to fix the performance by myself, but I think I need some help here. You can check out #56
@haishuangsu try updating to 1.1.1. It has some performance improvements for Buchheim Walker
Hey buddy,when my data list more than 100,i find a jank frame. BuchheimWalkerAlgorithm run() takes 700+ ms, how can i solve this problem, thx