4 ms·

I would be interested in the use case. It depends on how/what you want to display. Consider: https://gojs.net/latest/samples/virtualizedTree.html https://gojs.n

I would be interested in the use case. It depends on how/what you want to display. Consider: https://gojs.net/latest/samples/virtualizedTree.html https://gojs.net/latest/samples/virtualizedTree.html Layered Digraph is by far the slowest layout. In general as you get past ~5k nodes you should consider all of https://gojs.net/latest/intro/performance.html https://gojs.net/latest/intro/performance.html we have some niche performance examples like this (WARNING slightly epileptic) https://gojs.net/extras/10000parts.html https://gojs.net/extras/10000parts.html, but most of those are for internal testing and not too useful for customers.

recursivecaveat 2y ago
They're data-dependence graphs for a neural-network scheduling problem. Like this but way bigger to start with and then lowered to more detailed representations several times: https://netron.app/?url=https://github.com/onnx/models/raw/main/validated/vision/classification/squeezenet/model/squeezenet1.0-3.onnx https://netron.app/?url=https://github.com/onnx/models/raw/m... My home-grown layout engine can handle the 12k nodes for llama2 in its highest-level form in 20s or so, but its not the most featureful, and they only get bigger from there. So I always have an eye out for potential tools.