Community
Participate
Working Groups
It would be a useful feature to support a native ordering for nodes in the graph layout. Thus, any nodes would be laid out according to an ordinal assigned to each node. (e.g Node.order = 1,2,...n etc) The algorithm would try to perserve the ordering of the nodes provided no other conditions are broken such as crossed paths. It would even be nicer if the we could specify that the order be absolutely preserved even if paths are crossed...as an optional control parameter to the algorithm.
I have absolute ordering working. When would you need this "suggested" ordering?
3.0.1 would be a suitable target, but that may not be soon enough to make it into our final WSAD stream, which would be unfortunate. I'm open to ways we could incorporate the fix before then.
By "When", I meant what was the use case for specifying an ordering but not having it be guaranteed? We cannot add new fields for 3.0.1, which is how the ordering is specified.
The only use case I was thinking of is: - ordinals determine order for unconnected nodes - ordinals may be overridden whenever crossovers are detected at target inputs (especially when using the offset values at the target inputs, e.g. inputs to an "AND" gate) I'm not sure if this would be desirable in general, but if you don't see it as being useful for cleaner looking layouts, then absolute ordering is sufficient. What is next target for absolute ordering support?
