I'm trying to come up with an algorithm to print complex CSP graphs in a easy to understand manner. I originally thought maybe to center constraints around their domain nodes but that probably won't work well for domains attached to many constraints. The input for the algorithm would be domain nodes and constraint nodes with x, y coordinates then edges between them. The main issue is that edges get occluded by nodes if placed improperly and if the nodes are not wide spread then the nodes can overlap the edges giving the illusion there is a relation there rather than the edge is just passing through it to another node.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.