def draw_tree_grid(self, <EOL>nrows=None, <EOL>ncols=None, <EOL>start=<NUM_LIT:0>, <EOL>fixed_order=False, <EOL>shared_axis=False, <EOL>**kwargs):
<EOL>if not self.treelist:<EOL><INDENT>print("<STR_LIT>")<EOL>return None, None<EOL><DEDENT>if not fixed_order:<EOL><INDENT>treelist = self.copy().treelist<EOL><DEDENT>else:<EOL><INDENT>if fixed_order is True:<EOL><INDENT>fixed_order = self.treelist[<NUM_LIT:0>].get_tip_labels()<EOL><DEDENT>treelist = [<EOL>ToyTree(i, fixed_order=fixed_order) <EOL>for i in self.copy().treelist<EOL>]<EOL><DEDENT>for tree in treelist:<EOL><INDENT>tree.style.update(kwargs)<EOL><DEDENT>if not (ncols or nrows):<EOL><INDENT>ncols = <NUM_LIT:5><EOL>nrows = <NUM_LIT:1><EOL><DEDENT>elif not (ncols and nrows):<EOL><INDENT>if ncols:<EOL><INDENT>if ncols == <NUM_LIT:1>:<EOL><INDENT>if self.ntrees <= <NUM_LIT:5>:<EOL><INDENT>nrows = self.ntrees<EOL><DEDENT>else:<EOL><INDENT>nrows = <NUM_LIT:2><EOL><DEDENT><DEDENT>else:<EOL><INDENT>if self.ntrees <= <NUM_LIT:10>:<EOL><INDENT>nrows = <NUM_LIT:2><EOL><DEDENT>else:<EOL><INDENT>nrows = <NUM_LIT:3><EOL><DEDENT><DEDENT><DEDENT>if nrows:<EOL><INDENT>if nrows == <NUM_LIT:1>:<EOL><INDENT>if self.ntrees <= <NUM_LIT:5>:<EOL><INDENT>ncols = self.ntrees <EOL><DEDENT>else:<EOL><INDENT>ncols = <NUM_LIT:5><EOL><DEDENT><DEDENT>else:<EOL><INDENT>if self.ntrees <= <NUM_LIT:10>:<EOL><INDENT>ncols = <NUM_LIT:5><EOL><DEDENT>else:<EOL><INDENT>ncols = <NUM_LIT:3><EOL><DEDENT><DEDENT><DEDENT><DEDENT>else:<EOL><INDENT>pass<EOL><DEDENT>draw = TreeGrid(treelist)<EOL>if kwargs.get("<STR_LIT>"):<EOL><INDENT>return draw<EOL><DEDENT>canvas, axes = draw.update(nrows, ncols, start, shared_axis, **kwargs)<EOL>return canvas, axes<EOL>
Draw a slice of x*y trees into a x,y grid non-overlapping. 

Parameters:
-----------
x (int):
    Number of grid cells in x dimension. Default=automatically set.
y (int):
    Number of grid cells in y dimension. Default=automatically set.
start (int):
    Starting index of tree slice from .treelist.
kwargs (dict):
    Toytree .draw() arguments as a dictionary.