Open renyuneyun opened 4 years ago
The problem is that s1
does not have a connection to the rest of your nodes. The only algorithm that supports single nodes without a connection is the FruchtermanReingoldAlgorithm
.
Future versions will have some checks and better error messages to help unterstand what went wrong.
Thanks for explaining that. I wasn't aware that SugiyamaAlgorithm only works for fully-connected graphs.
Do you think it (in principle) is better for the user-side (i.e. me) to fix this by adding a virtual "root" node in my application, or should it be an option for the GraphView library to have the ability to add a virtual (and invisible) root node?
Sounds good to me. We'll think about it.
As the title says, the graph may run into problem in certain cases, when trying to draw itself.
My initialization of the algorithm is:
The known simplest graph structure is with three nodes (reported in renyuneyun/Easer#310 ):
I tried to dig into GraphView's code, but wasn't able to understand what
type1Conflicts
is meant for. Therefore, here is the stacktrace: