public void setVertexInput(Operator<Record> c) { this.iteration.setInitialSolutionSet(c); this.iteration.setInitialWorkset(c); }
public void setNumberOfIterations(int iterations) { this.iteration.setMaximumNumberOfIterations(iterations); }
public AggregatorRegistry getAggregators() { return this.iteration.getAggregators(); }
DeltaIteration iteration = new DeltaIteration(0, "Connected Components Iteration"); iteration.setInitialSolutionSet(verticesWithId); iteration.setInitialWorkset(verticesWithId); iteration.setMaximumNumberOfIterations(maxIterations); .input1(iteration.getWorkset()) .input2(edges) .name("Join Candidate Id With Neighbor") .input2(iteration.getSolutionSet()) .name("Min Id and Update") .build(); iteration.setNextWorkset(minAndUpdate); iteration.setSolutionSetDelta(minAndUpdate);
this.iteration = new DeltaIteration(0, name); .input2(iteration.getWorkset()) .name("Message Sender") .build(); this.vertexUpdater = CoGroupOperator.builder(VertexUpdateDriver.class, vertexKey, 0, 0) .input1(messager) .input2(iteration.getSolutionSet()) .name("Vertex Updater") .build(); iteration.setNextWorkset(vertexUpdater); iteration.setSolutionSetDelta(vertexUpdater);
@Override public boolean preVisit(Operator<?> visitable) { if (this.seen.add(visitable)) { // add to the map final String name = visitable.getName(); List<Operator<?>> list = this.map.get(name); if (list == null) { list = new ArrayList<Operator<?>>(2); this.map.put(name, list); } list.add(visitable); // recurse into bulk iterations if (visitable instanceof BulkIteration) { ((BulkIteration) visitable).getNextPartialSolution().accept(this); } else if (visitable instanceof DeltaIteration) { ((DeltaIteration) visitable).getSolutionSetDelta().accept(this); ((DeltaIteration) visitable).getNextWorkset().accept(this); } return true; } else { return false; } }
DeltaIteration iteration = new DeltaIteration(0, "Delta PageRank"); iteration.setInitialSolutionSet(initialSolutionSet); iteration.setInitialWorkset(initialDeltaSet); iteration.setMaximumNumberOfIterations(maxIterations); .input1(iteration.getWorkset()) .input2(dependencySet) .name("calculate dependencies") .input2(iteration.getSolutionSet()) .name("comparison with old ranks") .build(); iteration.setNextWorkset(updateRanks); iteration.setSolutionSetDelta(oldRankComparison);
DeltaIteration iteration = new DeltaIteration(0, "Connected Components Iteration"); iteration.setInitialSolutionSet(verticesWithId); iteration.setInitialWorkset(verticesWithId); iteration.setMaximumNumberOfIterations(maxIterations); .input1(iteration.getWorkset()) .input2(edges) .name("Join Candidate Id With Neighbor") .input2(iteration.getSolutionSet()) .name("Min Id and Update") .build(); iteration.setNextWorkset(minAndUpdate); iteration.setSolutionSetDelta(minAndUpdate);
DeltaIteration iteration = new DeltaIteration(0, "Connected Components Iteration"); iteration.setInitialSolutionSet(verticesWithId); iteration.setInitialWorkset(verticesWithId); iteration.setMaximumNumberOfIterations(maxIterations); .input1(iteration.getWorkset()) .input2(edges) .name("Join Candidate Id With Neighbor") .input2(iteration.getSolutionSet()) .name("Update Component Id") .build(); iteration.setSolutionSetDelta(mapper); } else { iteration.setSolutionSetDelta(updateComponentId); iteration.setNextWorkset(updateComponentId);
DeltaIteration iteration = new DeltaIteration(0, "Connected Components Iteration"); iteration.setInitialSolutionSet(verticesWithId); iteration.setInitialWorkset(verticesWithId); iteration.setMaximumNumberOfIterations(maxIterations); .input1(iteration.getWorkset()) .input2(edges) .name("Join Candidate Id With Neighbor") .input2(iteration.getSolutionSet()) .name("Update Component Id") .build(); iteration.setNextWorkset(updateComponentId); iteration.setSolutionSetDelta(updateComponentId);
DeltaIteration iteration = new DeltaIteration(0, "Connected Components Iteration"); iteration.setInitialSolutionSet(verticesWithId); iteration.setInitialWorkset(verticesWithId); iteration.setMaximumNumberOfIterations(maxIterations); .input1(iteration.getWorkset()) .input2(edges) .name("Join Candidate Id With Neighbor") .input1(iteration.getSolutionSet()) .input2(minCandidateId) .name("Update Component Id") .build(); iteration.setNextWorkset(updateComponentId); iteration.setSolutionSetDelta(updateComponentId);
DeltaIteration iteration = new DeltaIteration(0, "Connected Components Iteration"); iteration.setInitialSolutionSet(verticesWithId); iteration.setInitialWorkset(verticesWithId); iteration.setMaximumNumberOfIterations(maxIterations); .input1(iteration.getWorkset()) .input2(edges) .name("Join Candidate Id With Neighbor") .input1(iteration.getSolutionSet()) .input2(minCandidateId) .name("Update Component Id") .build(); iteration.setNextWorkset(updateComponentId); iteration.setSolutionSetDelta(updateComponentId);