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 void remove() { wrappedIterator.remove(); } }
private void removeVertex(Object vertex) { for (ArcIterator i = digraph.outgoingIterator(vertex); i.hasNext();) { i.next(); Object dst = i.getDestination(); InDegree indegree = (InDegree)inDegrees.get(dst); indegree.value--; } }
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 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 Object getDestination() { return wrappedIterator.getOrigin(); } public boolean hasNext() {
public Object getOrigin() { return wrappedIterator.getDestination(); } public Object getDestination() {
public boolean hasNext() { return wrappedIterator.hasNext(); } public Object next() {
public Object next() { return wrappedIterator.next(); } public void remove() {
public void convert(Digraph digraph) { for (Iterator i = digraph.vertexIterator(); i.hasNext();) { Object origin = i.next(); String key = vertexAccessor.getId(origin).toString(); StringBuffer value = new StringBuffer(); boolean firstDst = true; for (ArcIterator j = digraph.outgoingIterator(origin); j.hasNext();) { j.next(); if (firstDst) { value.append(vertexAccessor.getId(j.getDestination())); firstDst = false; } else value.append(';').append(j.getDestination()); } graphData.setProperty(key, value.toString()); } } public void setVertexAccessor(DataAccessor vertexAccessor) {
public Object getOrigin() { return transformOrigin(((ArcIterator)getIterator()).getOrigin()); }
public Object getDestination() { return transformDst(((ArcIterator)getIterator()).getDestination()); }
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 static Map shiftLevelsDown(Map vertexLevelMap, DigraphIteration digraph, Object root) { int minChildLevel = Integer.MAX_VALUE; for (ArcIterator i = digraph.outgoingIterator(root); i.hasNext(); ) { i.next(); Object child = i.getDestination(); shiftLevelsDown(vertexLevelMap, digraph, child); MutableInteger childLevel = (MutableInteger)vertexLevelMap.get(child); minChildLevel = (minChildLevel <= childLevel.intValue() ? minChildLevel : childLevel.intValue()); } if (minChildLevel != Integer.MAX_VALUE) { MutableInteger rootLevel = (MutableInteger)vertexLevelMap.get(root); rootLevel.setValue(minChildLevel - 1); } return vertexLevelMap; }
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; }
public static boolean isAcyclic(Digraph digraph) { int order = digraph.order(); if (order == 0) return true; Set spanned = new HashSet(order); DepthFirstStampSearch dfs = new DepthFirstStampSearch(digraph, digraph.vertexIterator().next()); for (Iterator i = digraph.vertexIterator(); i.hasNext();) { Object dfsRoot = i.next(); if (spanned.contains(dfsRoot)) continue; dfs.reset(dfsRoot); Map dfsOrders = dfs.traverse(new HashMap(digraph.order())); for (Iterator j = dfsOrders.entrySet().iterator(); j.hasNext();) { Map.Entry entry = (Map.Entry)j.next(); Object origin = entry.getKey(); DepthFirstStampSearch.OrderPair orgOrders = (DepthFirstStampSearch.OrderPair)entry.getValue(); spanned.add(origin); for (ArcIterator k = digraph.outgoingIterator(origin); k.hasNext();) { k.next(); Object dst = k.getDestination(); DepthFirstStampSearch.OrderPair dstOrders = (DepthFirstStampSearch.OrderPair)dfsOrders.get(dst); if (dstOrders.getPostOrder() > orgOrders.getPostOrder()) return false; } } if (dfsOrders.size() == order) break; } return true; }
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; }
for (Iterator j = origin.iterator(); j.hasNext();) { Object member = j.next(); for (ArcIterator k = digraph.outgoingIterator(member); k.hasNext();) { Object arc = k.next(); Object dst = k.getDestination(); if (origin.contains(dst)) continue; Collection destination = (Collection)memberToComponent.get(dst);
public Object next() { ArcIterator i = (ArcIterator)stack.peek(); Object origin = i.getOrigin(); Object dst = i.getDestination(); if (dst == null) { if (i.hasNext()) { i.next(); dst = i.getDestination(); } else { stack.pop(); if (i.hasNext()) i.next(); if (i.hasNext()) { i.next();