It is just consuming more memory and is less stable, isn’t it so?
How would you make it static, and at the same time possible to search/filter/manipulate it as at can today?
1 Like
I’m no graph-theorist, but I imagine it would be nearly impossible to have some deterministic layout that doesn’t change, but also adapts to new content, links, etc.
Can you think of any examples of graphs of growing and changing data that is not dynamic, and somehow keeps a stable view? (Maybe it exists. I’m not aware.)
And also bear in mind that there is no hierarchy or enforced directed-acyclic flow to the graph. So that means a note can link in both directions, or in a loop, or in a tight interconnected web. So then it becomes even less possible to deterministically lay that out.