public Object getDestination() { return wrappedIterator.getOrigin(); } public boolean hasNext() {
public Object getOrigin() { return transformOrigin(((ArcIterator)getIterator()).getOrigin()); }
public FilterArcIterator(ArcIterator iterator, Predicate acceptOrigin, Predicate acceptDestination, Predicate acceptArc) { super(iterator); this.acceptOrigin = acceptOrigin; this.acceptDestination = acceptDestination; this.acceptArc = acceptArc; nextOrigin = iterator.getOrigin(); if (!acceptOrigin.evaluate(nextOrigin)) nextOrigin = null; nextDst = iterator.getDestination(); if (!acceptDestination.evaluate(nextDst)) nextDst = null; }
private void splitLongArcs() { for (ArcIterator i = wrapperDigraph.arcIterator(); i.hasNext();) { i.next(); Object origin = i.getOrigin(); Object dst = i.getDestination(); int originLevel = wrapperLevelMap.get(origin).hashCode();
public static Digraph merge(Digraph destination,DigraphIteration graphToMerge) { for (Iterator i = graphToMerge.vertexIterator(); i.hasNext();) { destination.addVertex(i.next()); } for (ArcIterator i = graphToMerge.arcIterator(); i.hasNext();) { Object arc = i.next(); Object origin = i.getOrigin(); Object dst = i.getDestination(); destination.putArc(origin, dst, arc); } return destination; }
public Object next() { ArcIterator i = factory.outgoingIterator(queue.remove()); Object origin = i.getOrigin(); Integer childLevelValue = new Integer(level.get(origin).hashCode() + 1); while (i.hasNext()) { i.next(); Object dst = i.getDestination(); if (seen.add(dst)) { queue.add(dst); level.set(dst, childLevelValue); } else validTree = false; } return origin; }
public Object next() { ArcIterator i = (ArcIterator)stack.pop(); Object origin = i.getOrigin(); while (i.hasNext()) { i.next(); //origin = i.getOrigin(); Object dst = i.getDestination(); if (seen.add(dst)) stack.push(factory.outgoingIterator(dst)); } return origin; } }
public Object next() { Object currentVertex = queue.remove(); ArcIterator i = factory.outgoingIterator(currentVertex); Object origin = i.getOrigin(); while (i.hasNext()) { i.next(); Object dst = i.getDestination(); if (seen.add(dst)) queue.add(dst); } i = factory.incomingIterator(currentVertex); while (i.hasNext()) { i.next(); Object org = i.getOrigin(); if (seen.add(org)) queue.add(org); } return origin; }
Object origin = vertexToTable.get(i.getOrigin()); Object dst = vertexToTable.get(i.getDestination()); schemaGraph.putArc(origin, dst, Boolean.TRUE);
private void createWrapperDigraph() { wrapperDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); vertexWrapperMap = new HashMap(digraph.order()); for (Iterator i = digraph.vertexIterator(); i.hasNext();) { Object vertex = i.next(); VertexWrapper wrapper = new VertexWrapper(vertex); vertexWrapperMap.put(vertex, wrapper); wrapperDigraph.addVertex(wrapper); } for (ArcIterator i = digraph.arcIterator(); i.hasNext();) { i.next(); Object wrapper1 = vertexWrapperMap.get(i.getOrigin()); Object wrapper2 = vertexWrapperMap.get(i.getDestination()); if (rootsUpwards) wrapperDigraph.putArc(wrapper1, wrapper2, Boolean.TRUE); else wrapperDigraph.putArc(wrapper2, wrapper1, Boolean.TRUE); } }
private void init(Digraph digraph) { vertexRankMap = new HashMap(digraph.order()); IndegreeTopologicalSort traversal = new IndegreeTopologicalSort(digraph); while (traversal.hasNext()) { Object vertex = traversal.next(); int rank = -1; for (ArcIterator i = digraph.incomingIterator(vertex); i.hasNext(); ) { i.next(); Object predecessor = i.getOrigin(); int predRank = intValue(predecessor); if (predRank < 0) throw new ArithmeticException("Ranking failed."); rank = Math.max(rank, predRank); } rank++; assignRank(vertex, rank); } }
public static Digraph transform(Digraph result, DigraphIteration source, Transformer vertexTransform, Transformer arcTransform) { for (Iterator i = new TransformIterator(source.vertexIterator(), vertexTransform); i.hasNext();) { result.addVertex(i.next()); } for (ArcIterator i = new TransformArcIterator(source.arcIterator(), vertexTransform, arcTransform); i.hasNext();) { Object arc = i.next(); Object origin = i.getOrigin(); Object dst = i.getDestination(); result.putArc(origin, dst, arc); } return result; }
Object origin = i.getOrigin(); boolean subtreeIsTraversed = true; while (i.hasNext()) {
private boolean setNextObject() { ArcIterator iterator = (ArcIterator)getIterator(); while ( iterator.hasNext() ) { Object arc = iterator.next(); Object origin = iterator.getOrigin(); Object dst = iterator.getDestination(); if (acceptOrigin.evaluate(origin) && acceptArc.evaluate(arc) && acceptDestination.evaluate(dst)) { nextArc = arc; nextOrigin = origin; nextDst = dst; nextObjectSet = true; return true; } } return false; } }
for (ArcIterator i = longArcDigraph.arcIterator(); i.hasNext(); ) { LayerVertex dummy = (LayerVertex)i.next(); LayerVertex origin = (LayerVertex)i.getOrigin(); LayerVertex dst = (LayerVertex)i.getDestination(); int pointCount = dst.getRank() - origin.getRank() + 1;
LayerVertex origin = (LayerVertex)i.getOrigin(); LayerVertex dst = (LayerVertex)i.getDestination(); NestedSubgraph subgraph = origin.getParentSubgraph();
public Object next() { ArcIterator i = (ArcIterator)stack.peek(); Object origin = i.getOrigin(); Object dst = i.getDestination(); if (dst == null) {
Integer origin = (Integer) i.getOrigin(); String referencedTableName = "TABLE" + origin; String pkColumnName = referencedTableName + "_ID";