Object target = graph.getView().getVisibleTerminal(edge, invert); TreeNode tmp = dfs(target, parent, visited);
.getVisibleTerminal(true) : view.getVisibleTerminal( edges[i], true); Object target = (state != null) ? state .getVisibleTerminal(false) : view.getVisibleTerminal( edges[i], false);
.getVisibleTerminal(true) : view.getVisibleTerminal( edges[i], true); Object target = (state != null) ? state .getVisibleTerminal(false) : view.getVisibleTerminal( edges[i], false);
: view.getVisibleTerminal(edges[i], true); Object trg = (state != null) ? state.getVisibleTerminal(false) : view.getVisibleTerminal(edges[i], false);
: view.getVisibleTerminal(edges[i], true); Object trg = (state != null) ? state.getVisibleTerminal(false) : view.getVisibleTerminal(edges[i], false);
/** * */ protected String getEdgeId(Object edge) { mxGraphView view = graph.getView(); mxCellState state = view.getState(edge); Object src = (state != null) ? state.getVisibleTerminal(true) : view .getVisibleTerminal(edge, true); Object trg = (state != null) ? state.getVisibleTerminal(false) : view .getVisibleTerminal(edge, false); if (src instanceof mxICell && trg instanceof mxICell) { String srcId = mxCellPath.create((mxICell) src); String trgId = mxCellPath.create((mxICell) trg); return (srcId.compareTo(trgId) > 0) ? trgId + "-" + srcId : srcId + "-" + trgId; } return null; }
/** * */ protected String getEdgeId(Object edge) { mxGraphView view = graph.getView(); mxCellState state = view.getState(edge); Object src = (state != null) ? state.getVisibleTerminal(true) : view .getVisibleTerminal(edge, true); Object trg = (state != null) ? state.getVisibleTerminal(false) : view .getVisibleTerminal(edge, false); if (src instanceof mxICell && trg instanceof mxICell) { String srcId = mxCellPath.create((mxICell) src); String trgId = mxCellPath.create((mxICell) trg); return (srcId.compareTo(trgId) > 0) ? trgId + "-" + srcId : srcId + "-" + trgId; } return null; }
Object src = graph.getView().getVisibleTerminal(conns[k], true);
mxCellState state = graph.getView().getState(edge); Object source = (state != null) ? state.getVisibleTerminal(true) : graph.getView().getVisibleTerminal(edge, true); Object target = (state != null) ? state.getVisibleTerminal(false) : graph.getView().getVisibleTerminal(edge, false);
Object src = graph.getView().getVisibleTerminal(conns[k], true);
mxCellState state = graph.getView().getState(edge); Object source = (state != null) ? state.getVisibleTerminal(true) : graph.getView().getVisibleTerminal(edge, true); Object target = (state != null) ? state.getVisibleTerminal(false) : graph.getView().getVisibleTerminal(edge, false);
Object source = (state != null) ? state .getVisibleTerminal(true) : view .getVisibleTerminal(edges[j], true); Object target = (state != null) ? state .getVisibleTerminal(false) : view .getVisibleTerminal(edges[j], false);
Object source = (state != null) ? state .getVisibleTerminal(true) : view .getVisibleTerminal(edges[j], true); Object target = (state != null) ? state .getVisibleTerminal(false) : view .getVisibleTerminal(edges[j], false);
Object src = graph.getView().getVisibleTerminal( conns[j], true);
/** * Returns a union find structure representing the connection components of * G=(E,V). * * @param graph The object that contains the graph. * @param v The vertices of the graph. * @param e The edges of the graph. * @return Returns the connection components in G=(E,V) * * @see #createUnionFind(Object[]) */ public mxUnionFind getConnectionComponents(mxGraph graph, Object[] v, Object[] e) { mxGraphView view = graph.getView(); mxUnionFind uf = createUnionFind(v); for (int i = 0; i < e.length; i++) { mxCellState state = view.getState(e[i]); Object source = (state != null) ? state.getVisibleTerminal(true) : view.getVisibleTerminal(e[i], true); Object target = (state != null) ? state.getVisibleTerminal(false) : view.getVisibleTerminal(e[i], false); uf.union(uf.find(uf.getNode(source)), uf.find(uf.getNode(target))); } return uf; }
/** * Returns a union find structure representing the connection components of * G=(E,V). * * @param graph The object that contains the graph. * @param v The vertices of the graph. * @param e The edges of the graph. * @return Returns the connection components in G=(E,V) * * @see #createUnionFind(Object[]) */ public mxUnionFind getConnectionComponents(mxGraph graph, Object[] v, Object[] e) { mxGraphView view = graph.getView(); mxUnionFind uf = createUnionFind(v); for (int i = 0; i < e.length; i++) { mxCellState state = view.getState(e[i]); Object source = (state != null) ? state.getVisibleTerminal(true) : view.getVisibleTerminal(e[i], true); Object target = (state != null) ? state.getVisibleTerminal(false) : view.getVisibleTerminal(e[i], false); uf.union(uf.find(uf.getNode(source)), uf.find(uf.getNode(target))); } return uf; }
Object target = graph.getView().getVisibleTerminal(edge, invert); TreeNode tmp = dfs(target, parent, visited);
Object target = graph.getView().getVisibleTerminal(edge, invert); TreeNode tmp = dfs(target, parent, visited);
validateCellState(getVisibleTerminal(cell, true), false), true); state.setVisibleTerminalState( validateCellState(getVisibleTerminal(cell, false), false), false);
validateCellState(getVisibleTerminal(cell, true), false), true); state.setVisibleTerminalState( validateCellState(getVisibleTerminal(cell, false), false), false);