public void execute(Object parent) { mxIGraphModel model = graph.getModel(); List<Object> roots = graph.findTreeRoots(parent, true, invert);
/** * Returns all visible children in the given parent which do not have * incoming edges. If the result is empty then the with the greatest * difference between incoming and outgoing edges is returned. This * takes into account edges that are being promoted to the given * root due to invisible children or collapsed cells. * * @param parent Cell whose children should be checked. * @return List of tree roots in parent. */ public List<Object> findTreeRoots(Object parent) { return findTreeRoots(parent, false); }
/** * Returns all visible children in the given parent which do not have * incoming edges. If the result is empty then the with the greatest * difference between incoming and outgoing edges is returned. This * takes into account edges that are being promoted to the given * root due to invisible children or collapsed cells. * * @param parent Cell whose children should be checked. * @return List of tree roots in parent. */ public List<Object> findTreeRoots(Object parent) { return findTreeRoots(parent, false); }
/** * Returns all visible children in the given parent which do not have * incoming edges. If the result is empty then the children with the * maximum difference between incoming and outgoing edges are returned. * This takes into account edges that are being promoted to the given * root due to invisible children or collapsed cells. * * @param parent Cell whose children should be checked. * @param isolate Specifies if edges should be ignored if the opposite * end is not a child of the given parent cell. * @return List of tree roots in parent. */ public List<Object> findTreeRoots(Object parent, boolean isolate) { return findTreeRoots(parent, isolate, false); }
/** * Returns all visible children in the given parent which do not have * incoming edges. If the result is empty then the children with the * maximum difference between incoming and outgoing edges are returned. * This takes into account edges that are being promoted to the given * root due to invisible children or collapsed cells. * * @param parent Cell whose children should be checked. * @param isolate Specifies if edges should be ignored if the opposite * end is not a child of the given parent cell. * @return List of tree roots in parent. */ public List<Object> findTreeRoots(Object parent, boolean isolate) { return findTreeRoots(parent, isolate, false); }
@Override public void execute(Object parent) { mxIGraphModel model = graph.getModel(); List<Object> roots = graph.findTreeRoots(parent, true, invert);
public void execute(Object parent) { mxIGraphModel model = graph.getModel(); List<Object> roots = graph.findTreeRoots(parent, true, invert);