3.1. igraph_layout_merge_dla — Merge multiple layouts by using a DLA algorithm

3.1. `igraph_layout_merge_dla` — Merge multiple layouts by using a DLA algorithm

int igraph_layout_merge_dla(igraph_vector_ptr_t *thegraphs,
			    igraph_vector_ptr_t *coords, 
			    igraph_matrix_t *res);

First each layout is covered by a circle. Then the layout of the largest graph is placed at the origin. Then the other layouts are placed by the DLA algorithm, larger ones first and smaller ones last.

Arguments:

`thegraphs`:	Pointer vector containing the graph object of which the layouts will be merged.
`coords`:	Pointer vector containing matrix objects with the 2d layouts of the graphs in `thegraphs`.
`res`:	Pointer to an initialized matrix object, the result will be stored here. It will be resized if needed.

Returns:

Error code.

Added in version 0.2. This function is experimental.

Time complexity: TODO.