Functions  
void  abstractMixedGraph::Layout_Circular (TFloat spacing=0.0) throw (ERRejected) 
void  abstractMixedGraph::Layout_CircularByPredecessors (TFloat spacing=0.0) throw (ERRejected) 
void  abstractMixedGraph::Layout_CircularByColours (TFloat spacing=0.0) throw (ERRejected) 
bool  abstractMixedGraph::Layout_Outerplanar (TFloat spacing=0.0) throw (ERRejected) 
void  abstractMixedGraph::Layout_Equilateral (TFloat spacing=0.0) throw (ERRejected) 

Draw all nodes on the boundary of a circle.
With decreasing preference, the clockwise order of nodes is defined by one of the following properties:


Circular drawing based on a node colouring.
The clockwise order of nodes is with increasing colour indices and, for equal colour indices, with increasing node indices. 

Circular drawing based on given predecessor arcs.
The clockwise order of nodes is such that Hamiltonian cycles and 2factors are exposed. If the predecessor labels do not encode a 2factor, this procedure still puts the predecessor arcs on the exterior by using a greedy strategy. 

Multicircular drawing of outerplanar graphs.
An outerplanar representation must be set in advance. If so, the procedure displays precisely the given combinatorial embedding: It is not verified that a plane drawing results. In fact, this is true only in very special cases. The procedure can be used to produce paper models of 3D polyhedra, after separating some faces according to a spanning tree. 

Circular drawing of outerplanar graphs.
An outerplanar representation must be set in advance. If so, the procedure displays precisely the given combinatorial embedding: 