Circular layout

The Circular layout places graph nodes on a single circle, and helps point out on the first sight which nodes are connected to many other nodes (graph density), and helps you find out in an intuitive way the critical nodes of your graph. The algorithm is trivial and takes as input the number of nodes and the graph center position. It computes the adequate radius of the circle centered at the old graph center, nodes will be laid at its circumference. Once the radius is calculated, the algorithm places the nodes according to an assigned angle (360/number of nodes) and the circle radius.

Some features have been added to this layout to enable better usability: The Circular layout can be considered as trivial, but combined to highlighting effects, it can be used for the visualization of networks like social networks, computer networks and others.

This print screen shows an example the circular layout representation: