Suppose I have seperated a graph into a certain number of subgraphs. What is the best way to visualize the result nicely? (Algorithm ?) I am looking for something that would display nodes in a subgraph closer together and with as few as possible intersections for both internal as well as inter-subgraphs edges. It would also be nice if subgraphs would be differentiated somehow.
Any code snippets are welcome.
Thank you.
Edit: Sorry, I accidently posted this in Open Discussion. If someone could move it to Help, I could not find the option.
Last edit: rex 2015-02-24
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Hello all,
Suppose I have seperated a graph into a certain number of subgraphs. What is the best way to visualize the result nicely? (Algorithm ?) I am looking for something that would display nodes in a subgraph closer together and with as few as possible intersections for both internal as well as inter-subgraphs edges. It would also be nice if subgraphs would be differentiated somehow.
Any code snippets are welcome.
Thank you.
Edit: Sorry, I accidently posted this in Open Discussion. If someone could move it to Help, I could not find the option.
Last edit: rex 2015-02-24