public boolean setGraphPerspective(GraphPerspective gp) { if (gp.getRootGraph() != m_rootGraph) return false; final int[] nodeInx = gp.getNodeIndicesArray(); final int[] edgeInx = gp.getEdgeIndicesArray(); for (int i = 0; i < nodeInx.length; i++) m_rootGraph.addNodeMetaChild(m_rootGraphIndex, nodeInx[i]); for (int i = 0; i < edgeInx.length; i++) m_rootGraph.addEdgeMetaChild(m_rootGraphIndex, edgeInx[i]); return true; }
/** * DOCUMENT ME! * * @param gp DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean setGraphPerspective(GraphPerspective gp) { if (gp.getRootGraph() != m_rootGraph) return false; final int[] nodeInx = gp.getNodeIndicesArray(); final int[] edgeInx = gp.getEdgeIndicesArray(); for (int i = 0; i < nodeInx.length; i++) m_rootGraph.addNodeMetaChild(m_rootGraphIndex, nodeInx[i]); for (int i = 0; i < edgeInx.length; i++) m_rootGraph.addEdgeMetaChild(m_rootGraphIndex, edgeInx[i]); return true; }
/** * DOCUMENT ME! * * @param gp DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean setGraphPerspective(GraphPerspective gp) { if (gp.getRootGraph() != m_rootGraph) return false; final int[] nodeInx = gp.getNodeIndicesArray(); final int[] edgeInx = gp.getEdgeIndicesArray(); for (int i = 0; i < nodeInx.length; i++) m_rootGraph.addNodeMetaChild(m_rootGraphIndex, nodeInx[i]); for (int i = 0; i < edgeInx.length; i++) m_rootGraph.addEdgeMetaChild(m_rootGraphIndex, edgeInx[i]); return true; }
/** * Shows all edges for "nodeView" found that are part of the network associated with "view". */ public static void showEdges(final GraphView view, final NodeView nodeView) { final int[] neighbours = view.getGraphPerspective().neighborsArray(nodeView.getGraphPerspectiveIndex()); for (int n = 0; n < neighbours.length; ++n) { final int[] edges = view.getGraphPerspective().getEdgeIndicesArray(nodeView.getGraphPerspectiveIndex(), neighbours[n], true, true); for (int j = 0; j < edges.length; ++j) view.showGraphObject(view.getEdgeView(edges[j])); } }
/** * DOCUMENT ME! * * @param view DOCUMENT ME! */ public static void unHideNodesAndInterconnectingEdges(GraphView view) { if (view == null) { return; } for (Iterator i = view.getNodeViewsIterator(); i.hasNext();) { NodeView nview = (NodeView) i.next(); Node n = nview.getNode(); view.showGraphObject(nview); int[] na = view.getGraphPerspective().neighborsArray(nview.getGraphPerspectiveIndex()); for (int i2 = 0; i2 < na.length; ++i2) { int[] edges = view.getGraphPerspective() .getEdgeIndicesArray(nview.getGraphPerspectiveIndex(), na[i2], true); if (edges != null) for (int j = 0; j < edges.length; ++j) { EdgeView ev = view.getEdgeView(edges[j]); view.showGraphObject(ev); } } } view.updateView(); }
int[] edgeInxArr = persp2.getEdgeIndicesArray(); int[] edgeIndicesArray = persp.getEdgeIndicesArray(); connEdges = persp.getEdgeIndicesArray(nodeInx[1], nodeInx[0], false, true); connEdges = persp.getEdgeIndicesArray(nodeInx[0], nodeInx[3], true, true); connEdges = persp.getEdgeIndicesArray(nodeInx[1], nodeInx[2], false, true); connEdges = persp.getEdgeIndicesArray(nodeInx[2], nodeInx[1], true, false); connEdges = persp.getEdgeIndicesArray(nodeInx[2], nodeInx[2], false, false); connEdges = persp.getEdgeIndicesArray(nodeInx[2], nodeInx[2], true, true); connEdges = persp.getEdgeIndicesArray(nodeInx[2], nodeInx[3], false, false); connEdges = persp.getEdgeIndicesArray(nodeInx[3], nodeInx[2], false, false); connEdges = persp.getEdgeIndicesArray(nodeInx[4], nodeInx[0], true, true); connEdges = persp.getEdgeIndicesArray(99, 0, true, true); connEdges = persp.getEdgeIndicesArray(nodeInx[0], minNodeInx - 1, true, false); if ((persp.getEdgeIndicesArray(Integer.MAX_VALUE, Integer.MIN_VALUE, true, false) != null) || (persp.getEdgeIndicesArray(Integer.MIN_VALUE, Integer.MAX_VALUE, false, false) != null) || (persp.getEdgeIndicesArray(nodeInx[0], nodeNotInPersp.getRootGraphIndex(), false,
final int[] perspEdgeInxArr = perspective.getEdgeIndicesArray(); final int[] perspNodeInxArr = perspective.getNodeIndicesArray();
IntArrayList gpEdgeIndices = new IntArrayList(graphPerspective.getEdgeIndicesArray());