1.7. igraph_layout_reingold_tilford_circular — Circular Reingold-Tilford layout for trees

int igraph_layout_reingold_tilford_circular(const igraph_t *graph,
					    igraph_matrix_t *res, long int root);

This layout is almost the same as igraph_layout_reingold_tilford(), but the tree is drawn in a circular way, with the root vertex in the center.

Arguments:

`graph`:	The graph object.
`res`:	The result, the coordinates in a matrix. The parameter should point to an initialized matrix object and will be resized.
`root`:	The index of the root vertex.

Returns:

Error code.

See also:

igraph_layout_reingold_tilford().