Graph View Parenting system

RainBat · 2021-07-27T10:50:28.694Z

Use case or problem

I’m new to Obsidian, and i find it hard to find a node i’m looking for, i work in a top down approach, in the graph view the node with the most links has the biggest size, Even though it can be way down the line. Examle:
Parent: [[Child]]
Child:[[InnerChild]]
InnerChild:[[Ref1] …[[Ref15]]

image713×700 26 KB

Proposed solution

It would be nice to have these two implemented:
1)Hierarchical View as in

Parent
- Child
  - InnerChild
    - Ref1-15

if a reference is referenced many times simply duplicate adding it in the Hierarchy each time.
in case of a circular reference for examle Ref1:[[Parent]]
Either one is stronger than the other, or Both of similar strength. aka subtopics of a major topic.
a suggestion when making the reference would be helpful when someone types [[Parent]] in Ref1 a circular linking would be automatically detected and suggestions like
[[Parent->Ref1]] [[Parent<-Ref1]] [[Parent<->Ref1]] could be added.
in case both of similar strength we add a duplicate hierarchy with Ref1 at top.

Parent
- Child
  - InnerChild
    - Ref1
      *Parent

2)add option for node size to be dependent on how many children it has or adding the transitive layer into the equation. since Parent node links in transitive layer to all Ref1-Ref15.
To deal with circularity read above.

Current workaround (optional)

Star top level Markdown files and go down from there to find my notes.

Related feature requests (optional)

Allow to Configure How Node-Size is Calculated Feature requests

Dear Obsidian team, First off, thank you for making a software that I love to use every day. Coming from this love, I would like to make a request: Can we please have the ability to configure what variables are used to calculate and render the size of nodes in the graph-view? I believe the graph-view is one of the most important features of Obsidian. It has the potential to completely change how we discover, reason about and share new ideas. After figuring out how it currently works, adjust…

Graph nodes size should also depend on word count in addition to no of links Feature requests

In Graph view, the node size increases with increasing number of backlinks. But in such a case 2 notes having a huge difference in word count(say 10 and 100) have the same size. Wouldn’t it make sense to also take into account the word count to determine node size in Graph View?

Graph view node size scale multiplier Feature requests

Sometimes when it is very important to me to distinguish between the nodes that only have one connection and the nodes that have like 5-10, these two nodes almost look identical in size. It may be helpful to have a slider or shortcut to increase and decrease the node size scale multiplier. This may allow you to quickly find what you were looking for, then simply return the multiplier to a more reasonable value. Thanks.

quantumwisdom · 2021-08-28T14:55:41.692Z

I am with you there. This is exactly how I would like it. I structure my stuff in a a folder hierarchy, but in the graph view it goes against my intuition. The child notes 2 or 3 steps down are often large because they have so many notes linked to them. But I would prefer the “parent” notes to be larger because of how many total linked notes are “under” it.