164 	graph.foldCells = function(collapse, recurse, cells, checkFoldable, evt)  argument
172 			var newCells = cells.splice();
175 			for (var i = 0; i < cells.length; i++)
177 				if (isTreeCell(cells[i]))
179 					graph.traverse(cells[i], true, function(vertex, edge)
186 						if (vertex != cells[i])
192 						return vertex == cells[i] || !graph.model.isCollapsed(vertex);
195 					graph.model.setCollapsed(cells[i], collapse);
204 			cells = newCells;
215 	graph.removeCells = function(cells, includeEdges)  argument
219 		for (var i = 0; i < cells.length; i++)
221 			if (isTreeCell(cells[i]))
223 				graph.traverse(cells[i], true, function(vertex, edge)
235 				var edges = graph.getIncomingEdges(cells[i]);
236 				cells = cells.concat(edges);
240 				tmp.push(cells[i]);
244 		cells = tmp;
256 	graph.duplicateCells = function(cells, append)  argument
258 		cells = (cells != null) ? cells : this.getSelectionCells();
259 		var temp = cells.slice(0);
273 					mxUtils.remove(edges[j], cells);
281 			var result = graphDuplicateCells.call(this, cells, append);
283 			if (result.length == cells.length)
285 				for (var i = 0; i < cells.length; i++)
287 					if (isTreeCell(cells[i]))
290 						var edges = graph.getIncomingEdges(cells[i]);
312 	graph.moveCells = function(cells, dx, dy, clone, target, evt, mapping)  argument
324 				for (var i = 0; i < cells.length; i++)
326 					if (isTreeCell(cells[i]) || (graph.model.isEdge(cells[i]) &&
327 						graph.model.getTerminal(cells[i], true) == null))
335 				if (newSource != null && target == null && this.view.getState(cells[0]) != null)
337 					var edges = graph.getIncomingEdges(cells[0]);
359 			if (result.length == cells.length)
371 					else if (isTreeCell(cells[i]))
373 						var edges = graph.getIncomingEdges(cells[i]);
379 …			if (isTreeCell(newSource) && mxUtils.indexOf(cells, this.model.getTerminal(edges[0], true)) < 0)
845 				var cells = null;
851 						cells = (mxEvent.isShiftDown(evt)) ?
857 						cells = addSibling(graph.getSelectionCell(), !mxEvent.isShiftDown(evt));
861 				if (cells != null && cells.length > 0)
863 					if (cells.length == 1 && graph.model.isEdge(cells[0]))
865 						graph.setSelectionCell(graph.model.getTerminal(cells[0], false));
869 						graph.setSelectionCell(cells[cells.length - 1]);
960 				var cells = graphConnectVertex.call(this, source, direction, length, evt, forceClone,
966 					for (var i = 0; i < cells.length; i++)
968 						if (cells[i].getAttribute('treeRoot') == '1')
970 							graph.setAttributeForCell(cells[i], 'treeRoot', null);
980 			return cells;
988 		var cells = graphHandlerGetCells.apply(this, arguments);
989 		var temp = cells.slice(0);
1001 					mxUtils.remove(edges[j], cells);
1014 					if (edge != null && mxUtils.indexOf(cells, edge) < 0)
1016 						cells.push(edge);
1019 					if (mxUtils.indexOf(cells, vertex) < 0)
1021 						cells.push(vertex);
1029 		return cells;
1121 			graph.graphHandler.cells = [state.cell];
1122 …graph.graphHandler.bounds = graph.graphHandler.graph.getView().getBounds(graph.graphHandler.cells);
1123 			graph.graphHandler.pBounds = graph.graphHandler.getPreviewBounds(graph.graphHandler.cells);