Use case or problem
The graph view currently features one specific force-directed graph layout algorithm with a few parameters to be set by the user. However, the results of this are often not very satisfying; for instance, I often end up with many lines crossing in the graph, which makes the structure difficult to interpret.
Proposed solution
Network visualization software (e.g., Gephi, the igraph library for R and Python) typically include a large variation of layout algorithms for different purposes, including popular variations of force-directed layouts (Kamada–Kawai, Fruchterman–Reingold, etc) that work well for different scenario’s. I would suggest to implement some of these in Obsidian.
Current workaround (optional)
The current workaround is to play around with the parameters of the graph view and manually move around nodes until there are no more crossing lines and the graph looks nice. This is not very efficient as it has to be redone every time a node or link is added to the graph.