I don’t mean to sound explainy here, but I do like the topic of data structures so I’ll share my knowledge. If you’re familiar with the topic already disregard me. Same info can be found at graph vs tree - Google Search or the relevant computer science book chapter.
Important to note is
- trees (aka hierarchical lists, aka nested lists, aka n-dimensional arrays, aka the traditional data structure of mindmaps)
are a tiny subset of
- graphs (aka obsidian graph, aka wikilinks, aka ‘the web’)
So to make a graph into a tree you must delete every single link that isnt to their direct ancestor.
Trees are a very clean, very small subset of graphs, and that’s why they look so darn pretty. You deleted every single link that made things ‘messy’. It’s pure parent-child relationships all the way down.
mindmap aka tree:
In theory, if you told the graph renderer to ignore any link that wasn’t hierarchical, or just deleted all the [[links]] that arent parent-child, you’d get a graph that looks similar to above, but it might not make much sense after mass-deleting so many links.
So, yeah. Hope that helps somehow?