/** * DOCUMENT ME! * * @return DOCUMENT ME! */ public Node getSource() { return m_rootGraph.getNode(m_rootGraph.getEdgeSourceIndex(m_rootGraphIndex)); }
List neighList = root.neighborsList(root.getNode(nodeInx[0])); neighList = root.neighborsList(root.getNode(nodeInx[1])); neighList = root.neighborsList(root.getNode(nodeInx[2])); if (root.getNode(nodeIndex) == null) throw new IllegalStateException("bad node in neighbors"); neighList = root.neighborsList(root.getNode(nodeInx[3])); neighList = root.neighborsList(root.getNode(nodeInx[4])); if (root.isNeighbor(root.getNode(nodeInx[4]), root.getNode(nodeInx[4]))) throw new IllegalStateException("node with no edges is its own neigh"); if (root.isNeighbor(root.getNode(nodeInx[3]), root.getNode(nodeInx[1]))) throw new IllegalStateException("nodes are neighbors"); if (!root.isNeighbor(root.getNode(nodeInx[1]), root.getNode(nodeInx[0]))) throw new IllegalStateException("nodes are not neighbors"); if (root.isNeighbor(root2Node, root.getNode(nodeInx[2]))) throw new IllegalStateException("nodes from another graph is neighbor"); if (root.edgeExists(root.getNode(nodeInx[3]), root.getNode(nodeInx[1]))) throw new IllegalStateException("edge exists"); if (root.edgeExists(root.getNode(nodeInx[0]), root2Node))
final Node nodeNotInPersp = root.getNode(root.createNode()); final Edge edge1NotInPersp = root.getEdge(root.createEdge(nodeInx[1], nodeInx[3], true)); final Edge edge2NotInPersp = root.getEdge(root.createEdge(nodeInx[2], Node node2NotInPersp = root.getNode(root.createNode()); Edge edge3NotInPersp = root.getEdge(root.createEdge(nodeInx[1], nodeInx[2], true)); persp.restoreNode(node2NotInPersp);
/** * DOCUMENT ME! * * @return DOCUMENT ME! */ public final Node[] getRestoredNodes() { final Node[] returnThis = new Node[m_restoredNodeInx.length]; for (int i = 0; i < returnThis.length; i++) returnThis[i] = m_persp.getRootGraph().getNode(m_restoredNodeInx[i]); return returnThis; }
/** * DOCUMENT ME! * * @return DOCUMENT ME! */ public Node getTarget() { return m_rootGraph.getNode(m_rootGraph.getEdgeTargetIndex(m_rootGraphIndex)); }
public Node getTarget() { return m_rootGraph.getNode(m_rootGraph.getEdgeTargetIndex(m_rootGraphIndex)); }
/** * DOCUMENT ME! * * @param root DOCUMENT ME! * @param nodes DOCUMENT ME! */ public static final void testNodeNeighbors(RootGraph root, int[] nodes) { for (int j = 1; j < nodes.length; j++) { root.neighborsList(root.getNode(nodes[j])); } }
public Node getSource() { return m_rootGraph.getNode(m_rootGraph.getEdgeSourceIndex(m_rootGraphIndex)); }
private final int hideNode(GraphPerspective source, int rootGraphNodeInx) { // first see if we can hide the node final int returnThis = canHideNode(rootGraphNodeInx); // then notify everyone that we will be hiding nodes if (returnThis != 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; if (listener != null) { final Node removedNode = m_root.getNode(rootGraphNodeInx); listener.graphPerspectiveChanged(new GraphPerspectiveNodesHiddenEvent(source, new Node[] { removedNode })); } // now actually hide it actuallyHideNode(source, rootGraphNodeInx); } return returnThis; }
/** * DOCUMENT ME! * * @param args DOCUMENT ME! */ public static void main(String[] args) { final RootGraph root = new FingExtensibleRootGraph(new MyNodeDepot(), new MyEdgeDepot()); final Node n1 = root.getNode(root.createNode()); final Node n2 = root.getNode(root.createNode()); final Node n3 = root.getNode(root.createNode()); final Node n4 = root.getNode(root.createNode()); root.createEdge(n1, n2, false); int edge_idx = root.createEdge(n1, n3, false); final Edge del1 = root.getEdge(edge_idx); edge_idx = root.createEdge(n2, n3, false); final Edge del2 = root.getEdge(edge_idx); root.removeEdge(del1); root.removeEdge(del2); edge_idx = root.createEdge(n1, n4, false); final Edge subedge = root.getEdge(edge_idx); final Node src = subedge.getSource(); final Node target = subedge.getTarget(); if ((src == null) || (target == null)) throw new IllegalStateException("the bug is here"); } }
successArr[++index] = m_root.getNode(rootNodeInx[enumx.nextInt()]);